Sorting and searching

Comparison and distribution sorting algorithms (including their expected-cost analyses), and searching and selection in lists and arrays (binary and linear search, quickselect, median of medians, simultaneous min-max). Comparator sorting networks, their depth and the 0-1 principle form the Sorting networks subfield.

• Sorting networks
• Binary search
• Counting sort
• Heapsort
• Insertion sort
• Bucket sort
• Linear search
• Radix sort
• Rearranging a permutation into unimodal order
• Selection sort
• Simultaneous minimum and maximum
• Three-way partitioning
• Quickselect
• Median of medians
• Quicksort

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.