Data Structures and Algorithms · Searching and sorting

Non-comparison sorting

Sorting by exploiting known structure in the values themselves, counting or radix, instead of comparisons.

Also known as: counting sort, radix sort, bucket sort.

Start a lesson on Non-comparison sorting

Learn first

• Elementary comparison sorts: The simple O(n squared) sorts, bubble, insertion, selection, that compare and swap pairs of elements.

Related topics

• Divide-and-conquer sorting: Divide-and-conquer sorts, merge sort and quicksort, that beat O(n squared) by splitting the problem.