A non-comparison sort that sorts integers or fixed-length strings by processing one digit or character position at a time, from least to most significant, achieving linear time in the number of elements when the key length is bounded.
Facts
Time ComplexityO(d*n), where n is the number of keys and d is the key length in digits 1 Connections
Sources
1. Wikipedia: Radix sort
Complexity and performance
Radix sort operates in O(d·n) time, where n is the number of keys, and d is the key length in digits.
History
Radix sort dates back as far as 1887 to the work of Herman Hollerith on tabulating machines.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.