Editing Radix sort (section)

==External links==<!-- This section is linked from Radix sort -->
{{wikibooks|Algorithm implementation|Sorting/Radix_sort|Radix sort}}
*[https://www.codingeek.com/algorithms/radix-sort-explanation-pseudocode-and-implementation/ Explanation, Pseudocode and implementation] in C and Java
*[https://duvanenko.tech.blog/2017/06/15/faster-sorting-in-javascript/ High Performance Implementation] of LSD Radix sort in [[JavaScript]]
*[https://duvanenko.tech.blog/2018/05/23/faster-sorting-in-c/ High Performance Implementation] of LSD & MSD Radix sort in [[C Sharp (programming language)|C#]] with source in [https://github.com/DragonSpit/HPCsharp/ GitHub]
*[https://www.youtube.com/watch?v=6YyflHO9GdE Video tutorial of MSD Radix Sort] 
*[http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Sort/Radix/ Demonstration and comparison] of Radix sort with [[Bubble sort]], [[Merge sort]] and [[Quicksort]] implemented in [[JavaScript]]
*[http://www.codercorner.com/RadixSortRevisited.htm Article] about Radix sorting [[IEEE floating-point standard|IEEE floating-point]] numbers with implementation.
*:[http://www.stereopsis.com/radix.html Faster Floating Point Sorting and Multiple Histogramming] with implementation in C++
*Pointers to [https://web.archive.org/web/20060829193644/http://web-cat.cs.vt.edu/AlgovizWiki/RadixSort radix sort visualizations]
*[http://bitbucket.org/ais/usort/wiki/Home USort library] {{Webarchive|url=https://web.archive.org/web/20110807200359/https://bitbucket.org/ais/usort/wiki/Home |date=7 August 2011 }} contains tuned implementations of radix sort for most numerical C types (C99)
* [[Donald Knuth]]. ''The Art of Computer Programming'', Volume 3: ''Sorting and Searching'', Third Edition. Addison-Wesley, 1997. {{ISBN|0-201-89685-0}}. Section 5.2.5: Sorting by Distribution, pp.&nbsp;168–179.
* [[Thomas H. Cormen]], [[Charles E. Leiserson]], [[Ronald L. Rivest]], and [[Clifford Stein]]. ''[[Introduction to Algorithms]]'', Second Edition. MIT Press and McGraw-Hill, 2001. {{ISBN|0-262-03293-7}}. Section 8.3: Radix sort, pp.&nbsp;170–173.
* [https://web.archive.org/web/20010714213118/http://www.chinet.com/~edlee/bradsort.c BRADSORT v1.50 source code], by Edward Lee. BRADSORT v1.50 is a radix sorting algorithm that combines a binary trie structure with a circular doubly linked list.
* [https://web.archive.org/web/20191112193719/https://pdfs.semanticscholar.org/15b4/e7759573298a36ace2f898e437c9218cdfca.pdf Efficient Trie-Based Sorting of Large Sets of Strings], by Ranjan Sinha and Justin Zobel. This paper describes a method of creating tries of buckets which figuratively burst into sub-tries when the buckets hold more than a predetermined capacity of strings, hence the name, "Burstsort".
* [http://opendatastructures.org/versions/edition-0.1e/ods-java/11_2_Counting_Sort_Radix_So.html Open Data Structures - Java Edition - Section 11.2 - Counting Sort and Radix Sort], [[Pat Morin]]
* [http://opendatastructures.org/ods-cpp/11_2_Counting_Sort_Radix_So.html Open Data Structures - C++ Edition - Section 11.2 - Counting Sort and Radix Sort], [[Pat Morin]]

{{sorting}}

{{DEFAULTSORT:Radix Sort}}
[[Category:Articles with example C code]]
[[Category:Sorting algorithms]]
[[Category:Stable sorts]]
[[Category:String sorting algorithms]]