One simple but effective selection algorithm works nearly in the same manner as quicksort, except instead of making recursive calls on both sublists, it only makes a single tail-recursive call on the sublist which contains the desired element.
One simple but effective selection algorithm works nearly in the same manner as quicksort. It was making recursive calls on both sublists. It only makes a single tail-recursive call on the sublist. This sublist contains the desired element.