Editing Radix sort (section)

{{short description|Non-comparative integer sorting algorithm}}
{{Use dmy dates|date=October 2020}}
{{Infobox Algorithm
|name={{PAGENAMEBASE}}|class=[[Sorting algorithm]]
|image=
|data=[[Array data type|Array]]
|time=<math>O(w\cdot n)</math>, where <math>n</math> is the number of keys, and <math>w</math> is the key length.
|space=<math>O(w+n)</math>
|optimal=exactly correct
}}
In [[computer science]], '''radix sort''' is a non-[[Comparison sort|comparative]] [[sorting algorithm]]. It avoids comparison by creating and [[Distribution sort|distributing]] elements into buckets according to their [[radix]]. For elements with more than one [[significant digit]], this bucketing process is repeated for each digit, while preserving the ordering of the prior step, until all digits have been considered. For this reason, '''radix sort''' has also been called '''[[bucket sort]]''' and '''digital sort'''.

Radix sort can be applied to data that can be sorted [[Lexicographical order|lexicographically]], be they integers, words, punch cards, playing cards, or the [[Bucket sort#Postman's sort|mail]].