Bubble/Cocktail Sort - ANS-Best case: O(n)
Average: O(n^2)
Worst: O(n^2)
Insertion Sort - ANS-Best: O(n)
Average: O(n^2)
Worst: O(n^2)
Quicksort - ANS-Best: O(nlog(n)
Average: O(nlog(n)
Worst: O(n^2)
Merge Sort - ANS-Best: O(nlog(n)
Average: O(nlog(n)
Worst: O(nlog(n)
Selection Sort - ANS-Best: O(n^2)
Average: O(n^2)
Worst: O(n^2)
Binary Search - ANS-O(log(n): With list indices
O(n): With list slices
When is bubble sort faster than merge sort? - ANS-Bubblesort is faster when passing in
an already sorted list (checking if it's sorted)