|  | Home | Libraries | People | FAQ | More | 
A type of algorithm that sorts based upon distribution instead of by comparison. Wikipedia has an article about Radix Sorting. A more detailed description of various Radix Sorting algorithms is provided here:
Donald Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching, Second Edition. Addison-Wesley, 1998. ISBN 0-201-89685-0. Section 5.2.5: Sorting by Distribution, pp.168-179.
A high-speed comparison-based sorting algorithm that takes 𝑶(N * log(N)) time. See introsort and Musser, David R. (1997). "Introspective Sorting and Selection Algorithms", Software: Practice and Experience (Wiley) 27 (8), pp 983-993, available at Musser Introsort.
          A high-speed hybrid string sorting algorithm that string_sort
          ARL (Adaptive Left Radix) is a hybrid cache-friendly integer sorting algorithm
          with comparable speed on random data to integer_sort
Arne Maus, ARL, a faster in-place, cache friendly sorting algorithm, presented at NIK2002, Norwegian Informatics Conference, Kongsberg, 2002. Tapir, ISBN 82-91116-45-8.
          The algorithm that integer_sortinteger_sort