Sorting algorithms timeline
- 1887 – Radix Sort
- 1901 – Hellerith's Sorting Machine
- 1945 – Merge Sort
- 1946 – Insertion Sort
- 1954 – Counting Sort
- 1954 – Digital Sorting
- 1954 – Key Sort
- 1954 – Distribution sort
- 1956 – Bubble Sort
- 1956 – Address calculation sorting
- 1956 – Comparison Sort
- 1956 – Radix list sort
- 1957 – Two way insertion sort
- 1959 – Radix Sort (Modifed)
- 1959 – New Merge Sort
- 1959 – Shell Sort
- 1960 – Cascade Merge Sort
- 1960 – PolyPhase Merge Sort/Fobinocii Sort
- 1960 – Mathsort
- 1961 – Quick Sort
- 1962 – Oscillating Merge Sort
- 1962 – Patience Sort
- 1962 – Selection Sort
- 1962 – Topological Sort
- 1962 – Tournament Sort (tree sort)
- 1962 – Tree Sort (Modified)
- 1963 – Shuttle Sort
- 1964 – Biotonic Merge sort
- 1964 – Heap Sort
- 1968 – Batcher Odd-Even Merge Sort
- 1969 – List sort/List merge sort
- 1969 – Improved Quick sort
- 1972 – Brick sort
- 1972 – Binary Merge sort
- 1972 – Gyrating sort
- 1980 – Comb Sort
- 1980 – Proxmap Sort
- 1981 – Smooth Sort
- 1985 – B Sort
- 1985 – Unshuffle Sort
- 1990 – Stooge Sort
- 1993 – American Flag Sort
- 1994 – New Efficient Radix Sort
- 1996 – Self Indexed sort (SIS)
- 1996 – Splay Sort
- 1997 – Flash Sort
- 1997 – Introsort
- 1997 – J Sort
- 2000 – Gnome Sort
- 2000 – Bogo Sort
- 2002 – Tim Sort
- 2002 – Spread sort
- 2002 – Bead Sort
- 2004 – Burst Sort
- 2004 – Libarary Sort
- 2005 – Cycle Sort
- 2005 – Quicker sort
- 2008 – Pancake sorting
- 2011 – U Sort
- 2012 – Counting Position Sort
