O(n2) Algorithms
                                       Bubble Sort                 
      Bubble Sort                    with Early Out                      

    


Bi-Directional Bubble Sort             ShellSort O(n~1.40)
      with Early Out                 (via Delta Bubble Sort)

     


      Selection Sort                   Selection Sort
                                     with Min Key Swap

    


      Insertion Sort                   ShellSort O(n~1.25)
                                  (via Delta Insertion Sort)

    

O(nlog2n) Algorithms
      HeapSort                        MergeSort

    


      Quick Sort                      Quick Sort
                                    with BubbleSort (<= 6)

    


      Quick Sort                      Quick Sort
with Median Pivot & BSort         with Mean Index Pivot (Ideal) & BSort

    

O(n) Algorithms
      ProxMap Sort

    
Pass 1 - compute hit counts
Pass 2 - compute proxmap
Pass 3 - compute future insertion locations
Pass 4 - move keys to final locations