shakersort is still worse than straight insertion and straight selection (except in the pathological case of sorting sorted array quicksort beats heapsort by factor of to it sorts the inversely ordered array with speed practically identical to the one that is already sorted ordered random inverse straightinsertion binaryinsertion straightselection bubblesort shakersort shellsort heapsort quicksort nonrecquicksort straightmerge table execution times of sort programs with elements ordered random random straightinsertion binaryinsertion straightselection bubblesort shakersort shellsort heapsort quicksort nonrecquicksort straightmerge table execution times of sort programs with elements