@Article{FloydRivest-1975-Expected-time-bounds,
  author = 	 { Robert W. Floyd and Ronald L. Rivest },
  title = 	 { Expected time bounds for selection },
  journal = 	 { CACM },
  year = 	 { 1975 },
  month = 	 { March },
  volume = 	 { 18 },
  number = 	 { 3 },
  pages =        { 165--172 },
  url =          { http://doi.acm.org/10.1145/360680.360691 },
  doi =          { 10.1145/360680.360691 },
  publisher =    { ACM },
  acmid =        { 360691 },
  OPTkey = 	 {},
  OPTnote = 	 {},
  OPTannote = 	 {},
  abstract =     { 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 $i$th smallest of $n$ numbers is
                   $ n + \min(i,n-i) + o(n) $.  A lower bound within 9
                   percent of the above formula is also derived.
                 }                  
}