Talk:Algorithm Implementation/Sorting/Radix sort

enwiki history
* (cur) (last) 15:28, 1 December 2007 Oli Filth (t | c) (-7787) (Moved sample implementations to wikibooks, like most of the other sort algorithm articles) (×) * (cur) (last) 18:28, 29 November 2007 Ceros (t | c) (-55) (using source tag for sources) (×) * (cur) (last) 03:20, 14 November 2007 Ryan Roos (t | c) (-74) (Undid revision 171340418 by 203.131.127.234 (talk)) (×) * (cur) (last) 01:46, 14 November 2007 203.131.127.234 (t) (+74) (→C# least significant digit (LSD) radix sort implementation) (×) * (cur) (last) 15:07, 25 October 2007 SieBot (t | c) m (+2) (robot Modifying: uk:Сортування за розрядами) (×) * (cur) (last) 22:29, 22 October 2007 131.111.8.104 (t) (-1) (grammar nazi) (×) * (cur) (last) 11:46, 15 October 2007 200.253.230.100 (t) (-8) (→Least significant digit radix sorts) (×) * (cur) (last) 05:37, 9 October 2007 AntiSpamBot (t | c) (-1005) (BOT--Reverting edits by Pvamsiece to revision 157459675 (example\.com)) (×) * (cur) (last) 05:37, 9 October 2007 Pvamsiece (t | c) (+1005) (×) * (cur) (last) 20:44, 12 September 2007 DnetSvg (t | c) m (+1) (Switched to svg images) (×) * (cur) (last) 18:30, 19 August 2007 Oskar Sigvardsson (t | c) (+13) (→References - adding navbox) (×) * (cur) (last) 20:14, 13 August 2007 Dcoetzee (t | c) m (-33) (Reverted edits by Lilnepatiz (talk) to last version by Thijs!bot) (×) * (cur) (last) 20:13, 13 August 2007 Lilnepatiz (t | c) (+33) (×) * (cur) (last) 18:52, 5 August 2007 Thijs!bot (t | c) m (+18) (robot Adding: cs:Radix sort) (×) * (cur) (last) 05:43, 27 July 2007 Inquam (t | c) m (-126) (×) * (cur) (last) 20:02, 8 July 2007 GregorB (t | c) m (+8) (→C# least significant digit (LSD) radix sort implementation - Line wrap) (×)[–] * (cur) (last) 20:02, 8 July 2007 GregorB (t | c) (+135) (+cat) (×) * (cur) (last) 12:48, 5 July 2007 MisterSheik (t | c) (-342) (simplified) (×) * (cur) (last) 08:01, 2 July 2007 MrSeasword (t | c) (+26) (→C++ LSD Radix sort using STL, non-recursive implementation) (×) * (cur) (last) 14:56, 26 June 2007 Anchor Link Bot (t | c) (+51) (Notifying of internal link to section External links from Radix sort) (×) * (cur) (last) 21:48, 15 June 2007 65.57.245.11 (t) (+741) (→C++ LSD radix sort example of non-recursive implementation) (×) * (cur) (last) 07:30, 5 June 2007 CJLL Wright (t | c) m (-41) (category rename per CfD 2007 May 24 using AWB) (×) * (cur) (last) 22:01, 31 May 2007 Ahy1 (t | c) (-85) (→See also - rm burstsort link. It doesn't provide any information on Radix sort) (×) * (cur) (last) 19:34, 31 May 2007 169.229.53.213 (t) (-10) (→See also - changed link to more direct page for Burstsort library) (×) * (cur) (last) 07:38, 30 May 2007 Blashyrk (t | c) m (+95) (added burst sort to "see also section") (×) * (cur) (last) 04:28, 29 May 2007 MartinBot (t | c) m (+587) (BOT - rv 121.247.152.253 (talk) to last version by 24.12.11.31) (×) * (cur) (last) 04:28, 29 May 2007 121.247.152.253 (t) (-587) (→An example) (×) * (cur) (last) 03:32, 24 May 2007 24.12.11.31 (t) (-4) (Significance goes down as you go from left to right. Digits to the right are less significant.) (×)[–] * (cur) (last) 03:25, 24 May 2007 24.12.11.31 (t) (-3) (m) (×) * (cur) (last) 14:07, 23 May 2007 Chobot (t | c) m (+21) (robot Adding: ko:기수 정렬) (×) * (cur) (last) 05:13, 21 May 2007 Bbik (t | c) m (-9) (Link repetition cleanup. The text (of the full article, not just the intro) needs some help with repetition, too.) (×)[–] * (cur) (last) 05:11, 21 May 2007 Bbik (t | c) m (0) (→Recursion - "Next less" is if you're working up, which it's not, so therefore it should be "next most") (×) * (cur) (last) 17:44, 11 May 2007 200.219.249.101 (t) (+3) (→C sample MSD implementation) (×) * (cur) (last) 12:28, 1 May 2007 193.157.245.216 (t) (35,515 bytes) (added four ") (×)   * (cur) (last) 05:25, 2 April 2007 24.12.11.31 (t) ("next most" could be confused to mean the next more significant digit, so I changed it to "next less") (×)[–]    * (cur) (last) 04:55, 24 March 2007 24.12.11.31 (t) (Fixed broken link due to the change in heading capitalization.) (×)    * (cur) (last) 18:33, 18 March 2007 JhsBot (t | c) m (robot Adding: no:Radikssortering) (×)    * (cur) (last) 02:17, 15 March 2007 24.12.11.31 (t) (m) (×)    * (cur) (last) 02:14, 12 March 2007 Hdante (t | c) (→C++ LSD radix sort example of non-recursive implementation - removing useless comment) (×)    * (cur) (last) 09:13, 8 March 2007 24.12.11.31 (t) (m) (×)[–]    * (cur) (last) 09:05, 8 March 2007 24.12.11.31 (t) (Clarified meaning of paging space) (×)    * (cur) (last) 08:59, 8 March 2007 24.12.11.31 (t) (Defined memory fragmentation) (×) * (cur) (last) 22:17, 5 March 2007 24.12.11.31 (t) (Made the original, unsorted list in the LSD radix sort example more prominent) (×) * (cur) (last) 20:59, 5 March 2007 24.12.11.31 (t) (Revised paragraph structure and contents to make them more clear) (×) * (cur) (last) 18:53, 5 March 2007 24.12.11.31 (t) (m) (×) * (cur) (last) 17:27, 1 March 2007 216.87.108.136 (t) (→An example) (×) * (cur) (last) 13:06, 27 February 2007 151.199.38.32 (t) (→An example) (×) * (cur) (last) 13:10, 26 February 2007 80.168.225.144 (t) (→Sample implementations - formatting subheads again) (×)[–] * (cur) (last) 13:09, 26 February 2007 80.168.225.144 (t) (finishing formatting) (×) * (cur) (last) 13:08, 26 February 2007 80.168.225.144 (t) (formatting subheadings) (×) * (cur) (last) 05:47, 26 February 2007 Njahnke (t | c) m (comma before quote) (×) * (cur) (last) 21:41, 25 February 2007 Raul654 (t | c) (×) * (cur) (last) 21:17, 25 February 2007 Davidhorman (t | c) m (×) * (cur) (last) 21:14, 25 February 2007 TomCAnthony (t | c) m (Added in some paragraph breaks.) (×) * (cur) (last) 21:06, 25 February 2007 82.39.157.250 (t) (×) * (cur) (last) 20:23, 17 February 2007 Gwern (t | c) m (Robot-assisted disambiguation (you can help!): Queue (disambiguation)) (×) * (cur) (last) 12:49, 26 January 2007 24.12.11.31 (t) (Gave example of the difference between numeric ordering and lexicographics ordering.) (×) * (cur) (last) 06:41, 25 January 2007 PJY (t | c) m (→C sample MSD implementation - change link to c to c the programming language) (×) * (cur) (last) 20:17, 15 January 2007 Edcolins (t | c) m (→A Recursive Forward Radix Sort Example - tyop : readability,) (×) * (cur) (last) 02:38, 30 December 2006 Simon12 (t | c) m (Disambiguation, link to base) (×) * (cur) (last) 07:01, 29 December 2006 24.12.11.31 (t) (m) (×)[–] * (cur) (last) 13:02, 28 December 2006 24.12.11.31 (t) (m) (×) * (cur) (last) 12:32, 28 December 2006 24.12.11.31 (t) (Cleaned up code and added a lot of comments) (×) * (cur) (last) 03:50, 10 December 2006 Gwern (t | c) m (Robot-assisted disambiguation (you can help!): Java programming language) (×) * (cur) (last) 03:15, 10 December 2006 129.97.219.101 (t) (→A Recursive Forward Radix Sort Example) (×) * (cur) (last) 04:53, 2 December 2006 Rspeer (t | c) (→Least Significant Digit Radix Sorts - take out misinformation about big-O notation. You never assume constant memory.) (×) * (cur) (last) 23:37, 1 December 2006 Cuberoot31 (t | c) (Dispute seems over) (×) * (cur) (last) 07:42, 21 November 2006 DHN-bot (t | c) m (robot Modifying: lt:Skaitmeninis rikiavimo algoritmas) (×) * (cur) (last) 03:43, 17 November 2006 24.12.11.31 (t) (iostream.h and stdlib.h should work with all standard C++ compilers) (×) * (cur) (last) 03:43, 12 November 2006 216.145.71.254 (t) (→C++ LSD Radix Sort example of non-recursive implementation) (×) * (cur) (last) 12:47, 2 November 2006 88.81.227.162 (t) (→References) (×) * (cur) (last) 07:54, 29 October 2006 Ahy1 (t | c) (revert vandalism) (×) * (cur) (last) 05:40, 29 October 2006 64.91.0.137 (t) (→See also) (×)[–] * (cur) (last) 05:39, 29 October 2006 64.91.0.137 (t) (→See also) (×) * (cur) (last) 05:39, 29 October 2006 64.91.0.137 (t) (→Least Significant Digit Radix Sorts) (×) * (cur) (last) 08:05, 21 October 2006 24.12.11.31 (t) (Added more of an explanation of the O notation) (×)[–] * (cur) (last) 07:33, 20 October 2006 24.12.11.31 (t) (Made a distinction between numbers and number representations to be clear) (×) * (cur) (last) 07:16, 20 October 2006 24.12.11.31 (t) (Revised wording to be more clear) (×) * (cur) (last) 06:43, 20 October 2006 24.12.11.31 (t) (Revised wording to be more clear) (×) * (cur) (last) 06:08, 20 October 2006 24.12.11.31 (t) (Revised text to be more clear) (×) * (cur) (last) 05:49, 20 October 2006 24.12.11.31 (t) (Made the text more clear) (×) * (cur) (last) 05:13, 20 October 2006 24.12.11.31 (t) (m) (×) * (cur) (last) 23:12, 18 October 2006 24.12.11.31 (t) (Underlined some digits to make it more clear which digits are being processed) (×) * (cur) (last) 12:05, 18 October 2006 24.12.11.31 (t) (Revised wording about traversal.) (×) * (cur) (last) 11:57, 18 October 2006 24.12.11.31 (t) (Revised wording) (×) * (cur) (last) 11:09, 18 October 2006 24.12.11.31 (t) (Revised ambiguous language) (×) * (cur) (last) 06:48, 18 October 2006 24.12.11.31 (t) (Expanded on what is meant by a histogram in the context of radix sorting) (×) * (cur) (last) 19:32, 16 October 2006 24.12.11.31 (t) (It's sometimes possible to determine set membership in a list in constant time) (×) * (cur) (last) 04:42, 16 October 2006 24.12.11.31 (t) (Moved postal sort reference to the MSD radix sort section) (×) * (cur) (last) 21:39, 15 October 2006 24.12.11.31 (t) (m) (×) * (cur) (last) 21:38, 15 October 2006 24.12.11.31 (t) (m) (×) * (cur) (last) 19:10, 15 October 2006 24.12.11.31 (t) (Mentioned the possibility of using pointers to keys in an LSD sort) (×) * (cur) (last) 08:24, 15 October 2006 66.30.10.183 (t) (→C sample MSD implementation) (×)[–] * (cur) (last) 08:24, 15 October 2006 66.30.10.183 (t) (→Sample implementations) (×) * (cur) (last) 08:23, 15 October 2006 66.30.10.183 (t) (→Sample implementations) (×) * (cur) (last) 03:00, 15 October 2006 24.12.11.31 (t) (Separated discussion of LSD and MSD radix sorts) (×) * (cur) (last) 23:56, 14 October 2006 69.116.213.35 (t) (×)[–] * (cur) (last) 23:54, 14 October 2006 69.116.213.35 (t) (→C++ example of non-recursive implementation) (×) * (cur) (last) 23:49, 14 October 2006 69.116.213.35 (t) (→C/C++) (×) * (cur) (last) 23:48, 14 October 2006 69.116.213.35 (t) (→C/C++) (×) * (cur) (last) 20:57, 14 October 2006 24.12.11.31 (t) (Added Burstsort reference.) (×)[–] * (cur) (last) 20:14, 14 October 2006 24.12.11.31 (t) (This is edlee. Forgot my password. Adding requested revision.) (×) * (cur) (last) 23:19, 12 October 2006 71.235.102.239 (t) (See talk page) (×) * (cur) (last) 01:46, 12 October 2006 24.12.11.31 (t) (m) (×) * (cur) (last) 14:54, 21 September 2006 194.73.96.226 (t) (Items need not be keys, and need not be unique.) (×) * (cur) (last) 06:44, 14 September 2006 Fredrik (t | c) m (×) * (cur) (last) 08:37, 7 September 2006 Nguyen Thanh Quang (t | c) m (→References - vi) (×) * (cur) (last) 20:57, 1 September 2006 RTC (t | c) m (→See also) (×) * (cur) (last) 14:47, 27 August 2006 SmackBot (t | c) m (ISBN formatting &/or general fixes using AWB) (×) * (cur) (last) 22:06, 14 August 2006 88.11.173.229 (t) (→C++ example of non-recursive implementation) (×) * (cur) (last) 00:41, 8 August 2006 128.176.151.108 (t) (→External links) (×)[–] * (cur) (last) 00:40, 8 August 2006 128.176.151.108 (t) (→External links) (×) * (cur) (last) 06:04, 5 August 2006 209.152.117.83 (t) (→An example) (×)[–] * (cur) (last) 06:03, 5 August 2006 209.152.117.83 (t) (→An example) (×) * (cur) (last) 20:44, 4 August 2006 69.18.50.2 (t) (→An example) (×)[–] * (cur) (last) 20:44, 4 August 2006 69.18.50.2 (t) (→An example) (×) * (cur) (last) 17:38, 17 July 2006 VTBassMatt (t | c) (→External links) (×) * (cur) (last) 18:22, 27 June 2006 StrongMan (t | c) m (×) * (cur) (last) 01:43, 22 June 2006 83.17.58.50 (t) (link) (×) * (cur) (last) 16:03, 15 June 2006 137.65.45.13 (t) (fixed error in step 2) (×) * (cur) (last) 09:51, 12 June 2006 A5b (t | c) m (link to ru:~) (×) * (cur) (last) 04:23, 26 May 2006 71.112.103.189 (t) (→C#) (×) * (cur) (last) 12:41, 16 May 2006 FlaBot (t | c) m (robot Adding: it) (×) * (cur) (last) 00:20, 12 May 2006 Booyabazooka (t | c) (Category:Stable sorts) (×)[–] * (cur) (last) 22:58, 11 May 2006 Booyabazooka (t | c) m (link postal sort) (×) * (cur) (last) 04:38, 27 April 2006 Booyabazooka (t | c) m ("however" is not a conjuction) (×) * (cur) (last) 21:24, 26 April 2006 Edlee (t | c) (Regard 2 as 002. Least Significant Digit Radix sorts are stabile) (×) * (cur) (last) 23:26, 25 April 2006 71.209.19.167 (t) (spelling fix) (×) * (cur) (last) 19:23, 25 April 2006 128.131.200.27 (t) (→An example) (×) * (cur) (last) 22:26, 23 April 2006 RussHolsclaw (t | c) (→See also) (×) * (cur) (last) 04:41, 10 April 2006 129.237.156.132 (t) (→C#) (×) * (cur) (last) 21:26, 5 April 2006 128.105.165.130 (t) (×) * (cur) (last) 07:18, 19 March 2006 YurikBot (t | c) m (robot Adding: fi) (×) * (cur) (last) 20:45, 17 March 2006 Petri Krohn (t | c) (→See also - +IBM 80) (×) * (cur) (last) 04:19, 17 March 2006 YurikBot (t | c) m (robot Adding: he) (×) * (cur) (last) 08:53, 16 March 2006 Edlee (t | c) (Added information about inserting strings into internal nodes) (×)[–] * (cur) (last) 06:51, 16 March 2006 Edlee (t | c) m (×) * (cur) (last) 06:47, 16 March 2006 Edlee (t | c) m (Changed a reference to an example due to the movement of the text) (×) * (cur) (last) 23:21, 14 March 2006 Wwagner (t | c) (Reverting changes by 71.135.55.94 to last version by StuRat) (×) * (cur) (last) 23:13, 14 March 2006 71.135.55.94 (t) (→An example) (×) * (cur) (last) 19:18, 14 March 2006 StuRat (t | c) (→Sample implementations - Finished move.) (×)[–] * (cur) (last) 19:16, 14 March 2006 StuRat (t | c) (→Recursion - Removed vandalism and moved huge snow white section to it's own section.) (×) * (cur) (last) 22:29, 13 March 2006 199.90.6.26 (t) (→Recursion) (×)[–] * (cur) (last) 22:25, 13 March 2006 199.90.6.26 (t) (→Iterative version using queues) (×) * (cur) (last) 21:38, 13 March 2006 199.80.154.63 (t) (→Recursion) (×)[–] * (cur) (last) 21:30, 13 March 2006 199.80.154.63 (t) (→Iterative version using queues) (×) * (cur) (last) 02:22, 8 March 2006 Fuzzie (t | c) m (disambig Java link) (×) * (cur) (last) 18:23, 3 March 2006 Edlee (t | c) (→Recursion) (×)[–] * (cur) (last) 18:03, 3 March 2006 Edlee (t | c) (→Recursion - Added clarification.) (×) * (cur) (last) 17:16, 3 March 2006 Edlee (t | c) (→Recursion) (×) * (cur) (last) 14:12, 3 March 2006 Edlee (t | c) m (→Recursion) (×) * (cur) (last) 14:01, 3 March 2006 Edlee (t | c) (→Recursion) (×) * (cur) (last) 13:42, 3 March 2006 Edlee (t | c) m (×) * (cur) (last) 13:35, 3 March 2006 Edlee (t | c) m (×) * (cur) (last) 13:33, 3 March 2006 Edlee (t | c) (→Recursion - Revised wording to make it more general.) (×) * (cur) (last) 13:26, 3 March 2006 Edlee (t | c) (→Recursion) (×) * (cur) (last) 12:19, 3 March 2006 Edlee (t | c) (Added an example of a circularly threaded trie.) (×) * (cur) (last) 01:25, 2 March 2006 Edlee (t | c) (Added more detail to the discussion of trie traversal.) (×) * (cur) (last) 15:09, 27 February 2006 Edlee (t | c) (→External links - Added note about hexadecimal digits) (×) * (cur) (last) 12:53, 27 February 2006 Edlee (t | c) m (×) * (cur) (last) 12:37, 27 February 2006 Edlee (t | c) m (×) * (cur) (last) 12:24, 27 February 2006 Edlee (t | c) m (Linked to the correct picture name, which is case-sensitive) (×) * (cur) (last) 12:18, 27 February 2006 Edlee (t | c) (→Recursion - Added another illustration of a trie) (×) * (cur) (last) 08:09, 26 February 2006 Edlee (t | c) (→Recursion - Added diagram of one possible trie structure.) (×) * (cur) (last) 02:20, 24 February 2006 Edlee (t | c) m (×) * (cur) (last) 12:38, 23 February 2006 Edlee (t | c) m (→Recursion) (×) * (cur) (last) 10:56, 23 February 2006 Lightst (t | c) m (→C++ example of non-recursive implementation - Fixed comments in the code.) (×) * (cur) (last) 23:57, 22 February 2006 Edlee (t | c) (Radix sorts are simply unrelated to comparison-based quick sorts) (×)[–] * (cur) (last) 23:02, 22 February 2006 Edlee (t | c) m (→Recursion) (×) * (cur) (last) 22:53, 22 February 2006 Edlee (t | c) m (→Recursion) (×) * (cur) (last) 22:52, 22 February 2006 Edlee (t | c) m (×) * (cur) (last) 22:22, 22 February 2006 Edlee (t | c) m (spelling) (×) * (cur) (last) 11:00, 22 February 2006 24.12.11.31 (t) (Non sequitur) (×)[–] * (cur) (last) 10:39, 22 February 2006 24.12.11.31 (t) (Added summary of incremental trie-based radix sorts) (×) * (cur) (last) 06:12, 18 February 2006 84.134.113.7 (t) (Changed link) (×) * (cur) (last) 08:11, 17 February 2006 202.90.128.28 (t) (×) * (cur) (last) 08:11, 17 February 2006 202.90.128.21 (t) (×) * (cur) (last) 14:29, 16 February 2006 Lightst (t | c) m (→C++ example 2 - Fair enough. Added copyright notice and license (GFDL is not appropiate for source code imho)) (×) * (cur) (last) 22:39, 15 February 2006 Dcoetzee (t | c) (Please do not sign your contributions) (×) * (cur) (last) 22:28, 15 February 2006 Lightst (t | c) m (→C++ example 2 - Signed the code) (×) * (cur) (last) 19:48, 15 February 2006 81.76.123.165 (t) (→C/C++ example 2 - The former code had a very strange indentation and produced segmentation faults. This code has been tested in a Pentium M. Comments are welcome) (×) * (cur) (last) 16:24, 13 February 2006 131.91.83.29 (t) (Added link to another demonstration page.) (×) * (cur) (last) 16:34, 2 February 2006 66.9.95.117 (t) (Added other name for Radix sort.) (×) * (cur) (last) 23:50, 31 January 2006 Dcoetzee (t | c) (Accuracy, style/language) (×)[–] * (cur) (last) 23:49, 31 January 2006 Dcoetzee (t | c) (Revert accidental reversion and addition of grammatical error) (×) * (cur) (last) 23:47, 31 January 2006 Frencheigh (t | c) m (×) * (cur) (last) 23:47, 31 January 2006 Dcoetzee (t | c) (→An example - Fmt) (×)[–] * (cur) (last) 23:45, 31 January 2006 Dcoetzee (t | c) (→An example - Note on stableness) (×) * (cur) (last) 23:42, 31 January 2006 Dcoetzee (t | c) (Do not ever use "finitely many" to mean a "small number of") (×) * (cur) (last) 20:30, 29 January 2006 81.110.217.155 (t) (→C/C++ example 2) (×)[–] * (cur) (last) 20:30, 29 January 2006 81.110.217.155 (t) (→C/C++ example 2) (×) * (cur) (last) 20:30, 29 January 2006 81.110.217.155 (t) (×) * (cur) (last) 02:23, 14 January 2006 63.224.32.63 (t) (→C/C++) (×)[–] * (cur) (last) 02:22, 14 January 2006 63.224.32.63 (t) (→C/C++) (×) * (cur) (last) 13:16, 11 January 2006 Bluebot (t | c) m (Fixing C++ links) (×) * (cur) (last) 19:37, 29 December 2005 Dcoetzee (t | c) (Remove text/links - there is no radix sort implementations article at present, might be one in the future) (×) * (cur) (last) 18:15, 29 December 2005 84.60.22.85 (t) (→C#) (×) * (cur) (last) 19:00, 10 December 2005 Decrypt3 (t | c) m (rv) (×) * (cur) (last) 14:28, 10 December 2005 194.85.160.55 (t) (→External links) (×) * (cur) (last) 04:13, 10 December 2005 195.131.144.254 (t) (→C++) (×)[–] * (cur) (last) 04:11, 10 December 2005 195.131.144.254 (t) (→С++) (×) * (cur) (last) 04:09, 10 December 2005 195.131.144.254 (t) (→C#) (×) * (cur) (last) 03:14, 29 November 2005 Dcoetzee (t | c) (Change back to all comparison sorts, and change big O to &Omega; so it's correct) (×) * (cur) (last) 02:48, 29 November 2005 Frencheigh (t | c) m (bubble sort is a CS) (×) * (cur) (last) 02:16, 29 November 2005 Dcoetzee (t | c) (Link comparison sort) (×)[–] * (cur) (last) 03:44, 19 November 2005 Dcoetzee (t | c) m (Fix year) (×) * (cur) (last) 21:12, 18 November 2005 Dcoetzee (t | c) m (→References - Page fix) (×) * (cur) (last) 21:12, 18 November 2005 Dcoetzee (t | c) (→References - CLRS ref) (×) * (cur) (last) 09:25, 18 November 2005 Dcoetzee (t | c) (Fix Knuth ref) (×) * (cur) (last) 09:24, 18 November 2005 Dcoetzee (t | c) (Fix Knuth ref) (×) * (cur) (last) 09:12, 18 November 2005 Dcoetzee (t | c) (Add references section with Knuth reference) (×) * (cur) (last) 01:46, 15 November 2005 Frencheigh (t | c) (→External links - removing that dead link) (×) * (cur) (last) 13:14, 13 November 2005 221.134.9.50 (t) (→External links) (×) * (cur) (last) 21:09, 28 October 2005 20.137.18.50 (t) (→Sample implementations) (×) * (cur) (last) 16:47, 11 October 2005 198.96.86.4 (t) (×) * (cur) (last) 01:11, 7 October 2005 StuRat (t | c) m (Added "A".) (×) * (cur) (last) 00:20, 6 October 2005 128.42.167.181 (t) (×) * (cur) (last) 01:32, 4 October 2005 Frencheigh (t | c) (rv, see the example) (×) * (cur) (last) 16:41, 3 October 2005 24.62.122.25 (t) (→Recursion) (×) * (cur) (last) 15:05, 2 October 2005 StuRat (t | c) (→Efficiency - Grammar (added "the"s)) (×) * (cur) (last) 13:18, 2 October 2005 80.252.129.22 (t) (→Efficiency) (×) * (cur) (last) 16:19, 30 August 2005 Lt-wiki-bot (t | c) m (robot Adding: es) (×) * (cur) (last) 11:11, 15 August 2005 Sam Hocevar (t | c) m (→An example - grammar (it's / its)) (×) * (cur) (last) 22:04, 5 August 2005 StuRat (t | c) (→Recursion) (×) * (cur) (last) 21:52, 5 August 2005 172.142.201.90 (t) (→Recursion - Added recursion example.) (×)[–] * (cur) (last) 21:18, 5 August 2005 172.142.201.90 (t) (→Recursion) (×) * (cur) (last) 21:13, 5 August 2005 172.142.201.90 (t) (→Implementation) (×) * (cur) (last) 21:11, 5 August 2005 172.142.201.90 (t) (→Efficiency) (×) * (cur) (last) 21:08, 5 August 2005 172.142.201.90 (t) (→Application to Parallel Computing) (×) * (cur) (last) 21:03, 5 August 2005 172.142.201.90 (t) (→Recursion - Added headline text.) (×) * (cur) (last) 20:49, 5 August 2005 172.142.201.90 (t) (→Recursion - Added link to "parallel computing".) (×) * (cur) (last) 17:18, 5 August 2005 StuRat (t | c) (→Recursion - Added single pass/double pass discussion and expanded on parallel processing applications.) (×)[–] * (cur) (last) 09:11, 5 August 2005 StuRat (t | c) (→Recursion) (×) * (cur) (last) 22:30, 22 July 2005 Jemfinch (t | c) (There is absolutely no reason even to mention Java in this language-independent section.) (×) * (cur) (last) 08:18, 14 July 2005 RobotE (t | c) m (robot Modifying: lt) (×) * (cur) (last) 18:50, 8 July 2005 Sdr (t | c) m (fixed a typo (acheive to achieve)) (×) * (cur) (last) 22:45, 7 July 2005 128.221.4.201 (t) (Fixed misspelling of unwrapped.) (×) * (cur) (last) 23:47, 15 June 2005 EatMyShortz (t | c) (→An example - Added note) (×) * (cur) (last) 01:39, 30 May 2005 24.59.195.47 (t) (×) * (cur) (last) 15:55, 21 May 2005 84.175.158.190 (t) (Link to german version of this article) (×) * (cur) (last) 16:49, 19 May 2005 Fredrik (t | c) m (×) * (cur) (last) 22:20, 28 March 2005 201.0.20.223 (t) (×) * (cur) (last) 11:03, 21 March 2005 Knutux (t | c) m (interwiki: +lt) (×) * (cur) (last) 22:27, 8 March 2005 Ellywa (t | c) m (robot Adding:nl) (×) * (cur) (last) 00:38, 19 February 2005 Gameboyguy13 (t | c) m (spelling fix: radicies -> radices) (×) * (cur) (last) 18:16, 1 February 2005 Frencheigh (t | c) (fix links) (×)[–] * (cur) (last) 18:05, 1 February 2005 Frencheigh (t | c) (several) (×) * (cur) (last) 17:12, 1 February 2005 Frencheigh (t | c) m (→External links - mention that first FP link has imp. and sort-of indicate that the second follows the first) (×) * (cur) (last) 19:50, 28 January 2005 Sf222 (t | c) m (typo) (×) * (cur) (last) 15:46, 28 January 2005 Cal 1234 (t | c) m (→Recursion - fixed bold text and added link to bucket) (×) * (cur) (last) 23:22, 14 January 2005 Frencheigh (t | c) m (→External links - specific type of floating point) (×) * (cur) (last) 13:43, 29 November 2004 209.50.165.26 (t) (→Recursion) (×) * (cur) (last) 14:08, 26 November 2004 156.34.220.92 (t) (mentioned floating point and fixed a typo) (×)[–] * (cur) (last) 14:07, 26 November 2004 156.34.220.92 (t) (clarified the cases where we get O(n) and O(n log n) in practise) (×) * (cur) (last) 13:59, 26 November 2004 156.34.220.92 (t) (added multiple histogramming with link) (×) * (cur) (last) 23:26, 20 November 2004 65.67.63.228 (t) (removed quicksort from list of nlogn searches) (×) * (cur) (last) 15:29, 9 November 2004 Burn (t | c) m (+zh) (×) * (cur) (last) 15:08, 19 October 2004 Robbot (t | c) m (robot Modifying:fr) (×) * (cur) (last) 02:11, 9 September 2004 Guanabot (t | c) m (Guanaco - robot: changing unnecessary HTML entities to ISO-8859-1 characters - see Wikipedia:Special characters) (×) * (cur) (last) 21:51, 2 September 2004 Danakil (t | c) m (×)[–] * (cur) (last) 21:43, 2 September 2004 Danakil (t | c) (×) * (cur) (last) 21:41, 2 September 2004 Danakil (t | c) m (×) * (cur) (last) 14:58, 8 August 2004 82.161.6.36 (t) (→External links) (×)[–] * (cur) (last) 14:58, 8 August 2004 82.161.6.36 (t) (×) * (cur) (last) 14:57, 8 August 2004 82.161.6.36 (t) (×) * (cur) (last) 14:57, 8 August 2004 82.161.6.36 (t) (→External links) (×) * (cur) (last) 00:00, 29 July 2004 Frencheigh (t | c) m (→External links) (×)[–] * (cur) (last) 23:09, 28 July 2004 Frencheigh (t | c) m (→External links - radix sort of floating point) (×) * (cur) (last) 16:29, 15 June 2004 205.180.71.123 (t) (×) * (cur) (last) 14:11, 30 May 2004 Timwi (t | c) (Category:Sort algorithms) (×) * (cur) (last) 06:24, 24 April 2004 Eequor (t | c) m (Link to radix sort animation.) (×) * (cur) (last) 22:59, 4 April 2004 Dysprosia (t | c) m (fmt) (×) * (cur) (last) 22:27, 23 February 2004 Hashar (t | c) m (fr:) (×) * (cur) (last) 18:58, 20 February 2004 Ww (t | c) m (×) * (cur) (last) 18:01, 15 February 2004 Timwi (t | c) m (×) * (cur) (last) 21:24, 8 February 2004 Decrypt3 (t | c) m (×) * (cur) (last) 14:03, 17 December 2003 Hofoen (t | c) (replaced dead link) (×) * (cur) (last) 14:54, 4 December 2003 Mxn (t | c) m (×) * (cur) (last) 04:55, 3 November 2003 218.221.176.3 (t) (+ja) (×) * (cur) (last) 20:04, 8 August 2003 Nixdorf (t | c) m (link) (×) * (cur) (last) 08:43, 25 July 2003 Daniel Quinlan (t | c) m (×) * (cur) (last) 20:54, 23 June 2003 Heron (t | c) m (supercede -> supersede ) (×) * (cur) (last) 13:34, 26 April 2003 Notheruser (t | c) m (×)[–] * (cur) (last) 13:34, 26 April 2003 Notheruser (t | c) m (×) * (cur) (last) 15:10, 27 March 2003 Hfastedge (t | c) m (×) * (cur) (last) 01:59, 15 January 2003 TakuyaMurata (t | c) m (×)[–] * (cur) (last) 01:58, 15 January 2003 TakuyaMurata (t | c) (add in computer science) (×) * (cur) (last) 14:56, 30 November 2002 130.225.96.2 (t) (Corrected error in example, where 66 changed value to 67 and 65.) (×) * (cur) (last) 23:35, 22 October 2002 Derek Ross (t | c) m (typo) (×)[–] * (cur) (last) 23:35, 22 October 2002 Derek Ross (t | c) m (sp) (×) * (cur) (last) 17:43, 7 September 2002 AxelBoldt (t | c) m (×) * (cur) (last) 20:26, 16 July 2002 207.172.11.233 (t) (×)[–] * (cur) (last) 19:43, 16 July 2002 207.172.11.233 (t) (*from H Seward. email: hhseward@rcn.com) (×) * (cur) (last) 20:55, 10 March 2002 AxelBoldt (t | c) m (copyedit) (×) * (cur) (last) 16:48, 10 March 2002 Robert Merkel (t | c) (for integer keys, effectively O(n)) (×) * (cur) (last) 15:51, 25 February 2002 Conversion script (t) m (Automated conversion) (×) * (cur) (last) 08:49, 18 December 2001 Hannes Hirzel (t | c) m (×) * (cur) (last) 17:47, 12 December 2001 AxelBoldt (t | c) (No need to do it stably in recursive version.) (×) * (cur) (last) 05:35, 12 December 2001 Damian Yerrick (t | c) (It's a generalization of quicksort) (×) * (cur) (last) 19:42, 11 December 2001 Zundark (t | c) (sample implementation removed (see /Talk)) (×)[–] * (cur) (last) 18:57, 11 December 2001 Zundark (t | c) m (int -> unsigned (missed one)) (×) * (cur) (last) 18:55, 11 December 2001 Zundark (t | c) m (int -> unsigned int (in comment)) (×) * (cur) (last) 18:47, 11 December 2001 Zundark (t | c) (fixes to problems mentioned in /Talk) (×) * (cur) (last) 18:25, 11 December 2001 AxelBoldt (t | c) m (×) * (cur) (last) 18:15, 11 December 2001 Damian Yerrick (t | c) (If keyspace is proportional to number of items, you get O(n lg n). More info coming soon from my E2 article) (×) * (cur) (last) 17:18, 11 December 2001 AxelBoldt (t | c) (Clarifying my own clarifications) (×)[–] * (cur) (last) 01:04, 11 December 2001 AxelBoldt (t | c) (Added that it is linear not in the number of elements to be sorted, but in the sum of the keylengths. Moved fan message to /Talk) (×) * (cur) (last) 01:00, 11 December 2001 AxelBoldt (t | c) (Added that it is linear not in the number of elements to be sorted, but in the sum of the keylengths. Moved fan message to /Talk) (×) * (cur) (last) 18:24, 10 December 2001 206.80.116.xxx (t) (×) * (cur) (last) 08:15, 29 October 2001 Kragen (t) (Explained why radix sort isn't always used; improved spelling.)