Selection algorithm: Revision history

31 December 2005

• curprev 09:0309:03, 31 December 2005 Mlpkr talk contribs 12,257 bytes +86 No edit summary undo
• curprev 09:0209:02, 31 December 2005 Mlpkr talk contribs 12,171 bytes +1 Space between head and body. undo
• curprev 09:0109:01, 31 December 2005 Mlpkr talk contribs 12,170 bytes +39 Add sorting as real method used before table of contents undo
• curprev 08:5908:59, 31 December 2005 Mlpkr talk contribs 12,131 bytes +40 Order statistics undo
• curprev 08:5608:56, 31 December 2005 Mlpkr talk contribs 12,091 bytes +274 Add sublinear selection improvement data structure information undo
• curprev 08:5108:51, 31 December 2005 Mlpkr talk contribs 11,817 bytes −61 Looks like some one cut and pasted with no link or useful infomration undo

24 November 2005

• curprev 02:0902:09, 24 November 2005 Dcoetzee talk contribs 11,878 bytes −56 Remove performance benefit claim undo

19 November 2005

• curprev 03:3003:30, 19 November 2005 Dcoetzee talk contribs m 11,934 bytes 0 Fix year undo

18 November 2005

• curprev 23:4123:41, 18 November 2005 Dcoetzee talk contribs 11,934 bytes +58 →References: Add ref to section 14.1 undo
• curprev 23:4023:40, 18 November 2005 Dcoetzee talk contribs 11,876 bytes +61 →Using data structures to select in sublinear time: Ref undo
• curprev 22:5722:57, 18 November 2005 Dcoetzee talk contribs 11,815 bytes +17 →Lower bounds undo
• curprev 22:5522:55, 18 November 2005 Dcoetzee talk contribs 11,798 bytes +257 Add CLRS ref undo
• curprev 10:5310:53, 18 November 2005 Dcoetzee talk contribs 11,541 bytes +1,082 Lower bounds section and Knuth reference undo

15 November 2005

• curprev 07:3807:38, 15 November 2005 201.250.236.150 talk 10,459 bytes 0 →Using data structures to select in sublinear time undo

3 November 2005

• curprev 10:3410:34, 3 November 2005 70.34.106.63 talk 10,459 bytes −2 →Using data structures to select in sublinear time undo
• curprev 08:2508:25, 3 November 2005 203.212.236.177 talk 10,461 bytes +2 →Using data structures to select in sublinear time undo

8 October 2005

• curprev 20:4920:49, 8 October 2005 Amalthea talk contribs 10,459 bytes −26 Reverted. You really don't need binary search to find the k'th largest element in a sorted list. undo

4 August 2005

• curprev 23:5823:58, 4 August 2005 Dcoetzee talk contribs m 10,485 bytes +26 →Using data structures to select in sublinear time: Link binary search undo
• curprev 23:5623:56, 4 August 2005 Dcoetzee talk contribs m 10,459 bytes +26 →Linear general selection algorithms: Revert broken language fix undo

6 July 2005

• curprev 13:2613:26, 6 July 2005 Peter Grey talk contribs m 10,433 bytes +2 No edit summary undo

16 June 2005

• curprev 17:0717:07, 16 June 2005 Dcoetzee talk contribs 10,431 bytes −13 -wikicode undo

9 June 2005

• curprev 23:0623:06, 9 June 2005 130.83.244.129 talk 10,444 bytes −26 removed repetitions of "following it" and "preceding it" undo

25 May 2005

• curprev 00:1800:18, 25 May 2005 Dcoetzee talk contribs 10,470 bytes +3 →Using data structures to select in sublinear time undo

17 April 2005

• curprev 19:4419:44, 17 April 2005 Dcoetzee talk contribs 10,467 bytes +185 →Using data structures to select in sublinear time: a self-balancing binary search tree can easily be augmented to make it possible to find the ''k''th largest element in O(log n) time undo

16 April 2005

• curprev 14:3414:34, 16 April 2005 131.215.167.110 talk 10,282 bytes +4 →Linear general selection algorithms undo

1 March 2005

• curprev 04:2204:22, 1 March 2005 Dcoetzee talk contribs m 10,278 bytes −14 Link fix undo

8 December 2004

• curprev 19:0119:01, 8 December 2004 Shantavira talk contribs m 10,292 bytes 0 gm (only need => need only) undo

18 November 2004

• curprev 05:5205:52, 18 November 2004 Eric119 talk contribs 10,292 bytes +4 Please help out by clicking here to fix someone else's Wiki syntax undo

14 November 2004

• curprev 07:1807:18, 14 November 2004 Dcoetzee talk contribs 10,288 bytes −61 Looked closer, the anon is right undo
• curprev 07:1707:17, 14 November 2004 Dcoetzee talk contribs m 10,349 bytes +61 Reverted edits by 67.101.161.204 to last version by 137.111.13.34 undo
• curprev 05:2205:22, 14 November 2004 67.101.161.204 talk 10,288 bytes −61 No edit summary undo

10 November 2004

• curprev 02:1202:12, 10 November 2004 137.111.13.34 talk 10,349 bytes +25 →References undo

28 October 2004

• curprev 21:5521:55, 28 October 2004 Dcoetzee talk contribs m 10,324 bytes 0 →Linear minimum/maximum algorithms: Fix loop index undo
• curprev 21:5421:54, 28 October 2004 Dcoetzee talk contribs m 10,324 bytes −8 →Using data structures to select in sublinear time: -as well undo

27 October 2004

• curprev 21:5921:59, 27 October 2004 Dcoetzee talk contribs 10,332 bytes +697 == Using data structures to select in sublinear time == undo

5 October 2004

• curprev 17:3617:36, 5 October 2004 Dcoetzee talk contribs m 9,635 bytes +32 Bold undo
• curprev 17:3417:34, 5 October 2004 Dcoetzee talk contribs 9,603 bytes +168 Wikicode, corrections undo

28 May 2004

• curprev 21:1121:11, 28 May 2004 Maximus Rex talk contribs m 9,435 bytes +2 No edit summary undo

26 May 2004

• curprev 09:3109:31, 26 May 2004 Fredrik talk contribs m 9,433 bytes +16 link in-place undo

26 March 2004

• curprev 22:0822:08, 26 March 2004 Dcoetzee talk contribs 9,417 bytes +1,598 Noted advantages of minimum-based method and added section Selection as incremental sorting undo
• curprev 21:3421:34, 26 March 2004 Dcoetzee talk contribs m 7,819 bytes +25 or kth largest undo
• curprev 20:0120:01, 26 March 2004 Dcoetzee talk contribs m 7,794 bytes +2 Italics/quotes fix undo
• curprev 20:0020:00, 26 March 2004 Dcoetzee talk contribs m 7,792 bytes +4 Italics undo
• curprev 19:5819:58, 26 March 2004 Dcoetzee talk contribs m 7,788 bytes −1 Link fix undo
• curprev 16:2816:28, 26 March 2004 Dcoetzee talk contribs 7,789 bytes +75 Gave explicit time bound for minimum-based selection undo
• curprev 16:2716:27, 26 March 2004 Dcoetzee talk contribs m 7,714 bytes +1 Word fix undo
• curprev 16:2616:26, 26 March 2004 Dcoetzee talk contribs m 7,713 bytes −1 Link to algorithm undo
• curprev 16:2316:23, 26 March 2004 Dcoetzee talk contribs m 7,714 bytes +1 Made formula text undo
• curprev 16:1816:18, 26 March 2004 Dcoetzee talk contribs 7,713 bytes +5,556 Added lots of info about general selection algorithms undo

25 March 2004

• curprev 22:2622:26, 25 March 2004 Dcoetzee talk contribs 2,157 bytes +2,157 Initial page with intro, sorting-and-extract approach, min/max algorithms, and brief mention of O(n) worst-case selection algorithm, to expand upon later