User contributions for Duvavic1

1 July 2019

• 00:5400:54, 1 July 2019 diff hist 0 Block swap algorithms No edit summary

30 June 2019

• 02:3202:32, 30 June 2019 diff hist +136 Block swap algorithms No edit summary
• 01:5201:52, 30 June 2019 diff hist +1,061 N Block swap algorithms Initial creation of Block Swap page. Describe one of the three algorithms. Site "Programming Perls" book and pages that describe those algorithms

5 March 2019

• 21:1121:11, 5 March 2019 diff hist +1,193 Radix sort Added a description of a recent performance optimization for LSD Radix Sort

20 January 2018

• 21:3521:35, 20 January 2018 diff hist +91 Merge sort Improved wording and links to Parallel Merge Sort article and GitHub for C++ implementation Tag: Visual edit
• 21:2921:29, 20 January 2018 diff hist −16 Merge sort Updated the link to Parallel Merge Sort implementation to point to a newer location and working source code in GitHub Tag: Visual edit
• 20:1520:15, 20 January 2018 diff hist +213 Merge algorithm Added a link to a C++ parallel merge implementation Tag: Visual edit

24 November 2011

• 15:2015:20, 24 November 2011 diff hist +821 User talk:David Eppstein →Counting Sort edits
• 03:4703:47, 24 November 2011 diff hist +228 User talk:David Eppstein →Counting Sort edits: new section

22 November 2011

• 03:0203:02, 22 November 2011 diff hist +316 Counting sort →Variant algorithms

14 September 2011

• 01:0801:08, 14 September 2011 diff hist +203 Talk:Sorting algorithm →Clarification of Notation
• 01:0101:01, 14 September 2011 diff hist −13 Sorting algorithm Cleared up In-place Merge Sort worst case equation that led to a question about ambiguity of log^2n, changed to (logn)^2, which is what STL webpage states. Also, moved it next to Merge Sort within the table.

23 April 2011

• 01:1401:14, 23 April 2011 diff hist +25 Sorting algorithm →Comparison of algorithms
• 00:3300:33, 23 April 2011 diff hist +6 Counting sort →Variant algorithms
• 00:3200:32, 23 April 2011 diff hist +98 Counting sort →Variant algorithms
• 00:2700:27, 23 April 2011 diff hist −65 Counting sort →Variant algorithms

22 April 2011

• 01:1701:17, 22 April 2011 diff hist −3 Merge sort →Parallel processing

27 March 2011

• 00:3500:35, 27 March 2011 diff hist +10 Merge sort →Parallel Merge Sort
• 00:3200:32, 27 March 2011 diff hist +829 Merge sort →Comparison with other sort algorithms

5 March 2011

• 23:1323:13, 5 March 2011 diff hist +1,065 Merge algorithm No edit summary

27 January 2011

• 00:3700:37, 27 January 2011 diff hist +165 Radix sort →In-place MSD radix sort implementations

10 September 2010

• 03:0503:05, 10 September 2010 diff hist +31 Counting sort Clarified step 3 of the algorithm description to follow exactly what the source code does - store the number of elements in order from smallest to largest.

28 August 2010

• 23:5123:51, 28 August 2010 diff hist +605 Counting sort Added a section for Parallel implementations
• 23:3223:32, 28 August 2010 diff hist +911 Counting sort Added a section for using Counting Sort to efficiently sort arrays of 8-bit and 16-bit elements (unsigned and signed).
• 22:5722:57, 28 August 2010 diff hist −167 Counting sort Simplified and corrected the algorithm description.

23 August 2010

• 01:1001:10, 23 August 2010 diff hist +3,057 Talk:Radix sort Moved rebuttal to discussion for others to review before posting
• 01:0801:08, 23 August 2010 diff hist −2,959 Radix sort retracted and added to discussion

22 August 2010

• 17:4817:48, 22 August 2010 diff hist +2 Radix sort corrected an error lg(n) instead of 2^n
• 14:5514:55, 22 August 2010 diff hist +1,398 Radix sort Added further explanation how uniqueness constraint connects the size of keys to the number of keys.
• 04:2504:25, 22 August 2010 diff hist +1,559 Radix sort Added a rebuttal explanation to the Efficiency section.

21 August 2010

• 13:5813:58, 21 August 2010 diff hist +124 Sorting algorithm Added a statement about hybrid algorithm approach for Radix Sort improves performance significantly (see Radix Sort wikipage for reference)
• 13:5113:51, 21 August 2010 diff hist +26 Sorting algorithm Changed "chunk" s, which was unclear to "d" for digit, which is what Radix Sort uses
• 13:4113:41, 21 August 2010 diff hist +16 Sorting algorithm Corrected MSD Radix Sort memory usage to account for memory used by the count array at each level of recursion
• 01:4801:48, 21 August 2010 diff hist +2,097 Radix sort Split parallel computing into its own section, and added more details about parallel opportunities and problems
• 01:2601:26, 21 August 2010 diff hist −1,268 Radix sort Moved parallel sub-section to a section of its own.
• 01:2301:23, 21 August 2010 diff hist −237 Radix sort Removed references, since wikipedia created new reference, whereas reuse of current references was needed. Tag: references removed
• 01:2201:22, 21 August 2010 diff hist +645 Radix sort Added a small section on the benefits of the hybrid algorithm approach, which can lead to substantial speedup.
• 00:0700:07, 21 August 2010 diff hist +663 Talk:Radix sort →Efficiency

20 August 2010

• 17:1517:15, 20 August 2010 diff hist +1,225 Radix sort Added description of a stable MSD Radix sort implementation with a reference to the paper and implementation
• 16:4516:45, 20 August 2010 diff hist +115 Radix sort Added a comment about both in-place MSD radix sort algorithms described not being stable.
• 11:5911:59, 20 August 2010 diff hist +59 Radix sort Added an external link to the referenced paper on in-place hybrid MSD n-bit-Radix Sort
• 11:5711:57, 20 August 2010 diff hist +1,049 Radix sort Added description of in-place MSD n-bit-Radix Sort implementation along with reference to paper and code
• 11:1911:19, 20 August 2010 diff hist +44 Sorting algorithm Corrected MSD Radix Sort memory usage to account for stack storage, where recursive implementations have k/s stack depth
• 02:1002:10, 20 August 2010 diff hist +1,499 Radix sort Added "In-Place MSD Radix Sort" section, explaining in-place MSD binary-radix sort steps and providing two references to implementations and explanations.
• 00:0400:04, 20 August 2010 diff hist +269 N User talk:217.125.226.47 ←Created page with 'Your analysis of efficiency is interesting. Could you elaborate how k is related to n for the case of an array of 1 billion elements and each element is 8-bits, wi...'

18 August 2010

• 17:1717:17, 18 August 2010 diff hist +324 Sorting algorithm Radix Sort high-level description now matches the Radix Sort wikipage, by describing the algorithm in terms of processing digits and not bits of each number.
• 02:2502:25, 18 August 2010 diff hist +246 Sorting algorithm MSD Radix Sort in-place version is possible by swapping elements and keeping track of the bins within the source array. Reference to the paper and description is coming on Radix Sort wiki page
• 02:2002:20, 18 August 2010 diff hist +73 Sorting algorithm MSD Radix Sort stable version is possible by using an external array of size n to hold all of the bins
• 02:0502:05, 18 August 2010 diff hist −10 Sorting algorithm MSD Radix Sort worst-case running time is O( kn ), same as for LSD Radix Sort. These are listed on the Radix Sort wiki page.