2784	 Expected Time Bounds for Selection	 A new selection algorithm is presented which is shown to be very efficient on the average both theoretically and practically. The number of comparisons used to select the ith smallest of n numbers is n min i n-i o n . A lower bound within percent of the above formula is also derived. selection computational complexity medians tournaments quantiles
