Radix sort is a non-comparative integer sorting algorithm that sorts numbers by processing individual digits. It is particularly efficient for sorting large sets of integers or strings where the number of digits (or characters) in the keys is relatively small compared to the number of keys.

Ancestors (6)

  1. Sorting algorithms
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version