Radix sort
Non-comparative integer sorting algorithm / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Radix sort?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
In computer science, radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and 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.
Quick Facts Class, Data structure ...
Class | Sorting algorithm |
---|---|
Data structure | Array |
Worst-case performance | , where is the number of keys, and is the key length. |
Worst-case space complexity | |
Optimal | exactly correct |
Close
Radix sort can be applied to data that can be sorted lexicographically, be they integers, words, punch cards, playing cards, or the mail.