1Only sorts numbers. Sort by each digit one at a time going from right-most digit to left-most
Radix Sort
3Big-O of Counting Sort
O(n)
4Big-O of Bucket Sort
O(n)
5Big-O of Merge Sort
O(nlogn)
6Big-O of Heap Sort
O(nlogn)
7Big-O of Quicksort
O(n^2)
8Big-O of Bubble Sort
O(n^2)
9Big-O of Insertion Sort
O(n^2)
10Big-O of Selection Sort
O(n^2)
11Big-O of Sequential Search
O(n)
12Big-O of Binary Search
O(logn)
13Average complexity
Big Theta
14Worst case complexity
Big O
15Best case complexity
Big Omega
16logba > exponent on f(n)
O(n^(logba))
17logba < exponent on f(n)
O(f(n))
18logba == exponent on f(n)
O(f(n)*log2n)
19Go through list, swapping values two at a time if out of place. Larger numbers gradually move towards the end.
Bubble Sort
20Work left to right. Examine each item and compare it to items on its left. Insert the item in the correct position in the array.
Insertion Sort
21During each iteration, select the smallest item from the unsorted partition and move it to the sorted partition.
Selection Sort
22Go through each number. If less than pivot, swap it with the first value greater than the pivot. Place pivot between smaller numbers and larger numbers.
Partition algorithm