Skip to content

Latest commit

 

History

History
 
 

Comparison of all sorting algorithms

Algorithm Complexity When to use?
3-way-string-quicksort.js O(N^2)
bubblesort.js O(N^2) Go here
bucketsort.js O(N)
countingsort.js O(N) Go here
heapsort.js O(N log N) Go here
insertion-binary-sort.js O(N^2)
insertionsort.js O(N^2) Go here
lsd.js O(N*M) for N keys which have M or fewer digits
mergesort.js O(n log(n)) Go here, & here
msd.js O(N*M) for N keys which have M or fewer digits
oddeven-sort.js O(N^2)
quicksort-middle.js O(N log(N))
quicksort.js O(nlog n) Go here, & here
radixsort.js O(N K) for N keys with K being Go here
recursive-insertionsort.js O(N^2)
selectionsort.js O(N^2) Go here
shellsort.js O((nlog(n))^2)