Sorting Algo Avg. Complexity Worst Case Complexity Space Complexity Stable Bubble Sort ~n2 O(n2) 1 yes Selection Sort ~n2 O(n2) 1 no Insertion Sort ~n2 O(n2) 1 yes Shell Sort ~n1.5 Depends on gap sequence 1 no Quick Sort ~nlogn O(nlogn) logn no Merge Sort ~nlogn O(nlogn) 1 yes Heap Sort ~nlogn O(nlogn) 1 no Binary Sort ~nlogn O(nlogn) n yes I Bubble Sort Basic Idea: Compare 2 adjacent numbers, b