You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Michael Reber b880c3ccde Initial commit 5 years ago
..
3-way-string-quicksort.js Initial commit 5 years ago
LZW.js Initial commit 5 years ago
avl-tree.js Initial commit 5 years ago
bellman-ford.js Initial commit 5 years ago
bfs.js Initial commit 5 years ago
binary-search-tree.js Initial commit 5 years ago
binarysearch.js Initial commit 5 years ago
bresenham-line-drawing.js Initial commit 5 years ago
bubblesort.js Initial commit 5 years ago
bucketsort.js Initial commit 5 years ago
cartesianproduct.js Initial commit 5 years ago
combinations.js Initial commit 5 years ago
countingsort.js Initial commit 5 years ago
dfs.js Initial commit 5 years ago
dijkstra.js Initial commit 5 years ago
edge.js Initial commit 5 years ago
fibonacci.js Initial commit 5 years ago
fisheryates.js Initial commit 5 years ago
floyd-warshall.js Initial commit 5 years ago
hanoi.js Initial commit 5 years ago
hash-table.js Initial commit 5 years ago
heap.js Initial commit 5 years ago
heapsort.js Initial commit 5 years ago
insertion-binary-sort.js Initial commit 5 years ago
insertionsort.js Initial commit 5 years ago
interval-tree.js Initial commit 5 years ago
is-prime.js Initial commit 5 years ago
knuth-morris-pratt.js Initial commit 5 years ago
levenshtein-distance.js Initial commit 5 years ago
linked-list.js Initial commit 5 years ago
longest-common-subsequence.js Initial commit 5 years ago
longest-increasing-subsequence.js Initial commit 5 years ago
lsd.js Initial commit 5 years ago
maximum-subarray-divide-and-conquer.js Initial commit 5 years ago
maximum-subarray.js Initial commit 5 years ago
mergesort.js Initial commit 5 years ago
min-coins-change.js Initial commit 5 years ago
msd.js Initial commit 5 years ago
oddeven-sort.js Initial commit 5 years ago
permutations.js Initial commit 5 years ago
prim.js Initial commit 5 years ago
prime-factor-tree.js Initial commit 5 years ago
quickfind.js Initial commit 5 years ago
quickselect.js Initial commit 5 years ago
quicksort-middle.js Initial commit 5 years ago
quicksort.js Initial commit 5 years ago
quickunion.js Initial commit 5 years ago
radixsort.js Initial commit 5 years ago
readme.js Initial commit 5 years ago
recursive-binarysearch.js Initial commit 5 years ago
recursive-insertionsort.js Initial commit 5 years ago
red-black-tree.js Initial commit 5 years ago
richarddurstenfeld.js Initial commit 5 years ago
runlength.js Initial commit 5 years ago
selectionsort.js Initial commit 5 years ago
shellsort.js Initial commit 5 years ago
sieve-of-eratosthenes.js Initial commit 5 years ago
size-balanced-tree.js Initial commit 5 years ago
splay-tree.js Initial commit 5 years ago
suffix-tree.js Initial commit 5 years ago
tarjan-connected-components.js Initial commit 5 years ago
topological-sort.js Initial commit 5 years ago
variations-repetition.js Initial commit 5 years ago
vertex.js Initial commit 5 years ago
weightquickunion.js Initial commit 5 years ago

readme.js

# Comparison of all sorting algorithms

| Algorithm                  | Complexity                                          | When to use? |
|----------------------------|-----------------------------------------------------|--------------|
| 3-way-string-quicksort.js  | O(N^2)                                              |              |
| bubblesort.js              | O(N^2)                                              |              |
| bucketsort.js              | O(N)                                                |              |
| countingsort.js            | O(N)                                                |              |
| heapsort.js                | O(N log N)                                          |              |
| insertion-binary-sort.js   | O(N^2)                                              |              |
| insertionsort.js           | O(N^2)                                              |              |
| lsd.js                     | O(N*M) for N keys which have M or fewer digits      |              |
| mergesort.js               | O(n log(n))                                         |              |
| 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)                                           |              |
| radixsort.js               | O(N K) for N keys with K being                      |              |
| recursive-insertionsort.js | O(N^2)                                              |              |
| selectionsort.js           | O(N^2)                                              |              |
| shellsort.js               | O((nlog(n))^2)                                      |              |