Revision as of 04:33, 30 March 2023 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,660 edits →References: still cs1 ← Previous edit		Revision as of 04:38, 30 March 2023 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,660 edits →Further reading: not sure what value Kiwiel adds; the O((n log n)^{2/3}) version of Rivest & Floyd is unproblematic, and equal values are not an interesting case (break the ties). Knuth needs to stay here until he can be promoted to an actual reference, though. Next edit →
Line 181: ==Further reading== {{refbegin}} * {{Cite journal \| last1 = Kiwiel \| first1 = K. C. \| doi = 10.1016/j.tcs.2005.06.032 \| title = On Floyd and Rivest's SELECT algorithm \| journal = Theoretical Computer Science \| volume = 347 \| pages = 214–238 \| year = 2005 \| issue = 1–2 \| doi-access = free }} * [[Donald Knuth]]. ''[[The Art of Computer Programming]]'', Volume 3: ''Sorting and Searching'', Third Edition. Addison-Wesley, 1997. {{ISBN\|0-201-89685-0}}. Section 5.3.3: Minimum-Comparison Selection, pp. 207–219. {{refend}}

Selection algorithm: Difference between revisions