Overview of Sorting Algorithms

Now that we’ve gone over how most famous and important sorting algorithms work, here’s a quick table that you can refer to when you are solving coding problems!

	Insertion	Selection	Merge	Quick Sort
Best Case	$O(n)$	$O(n^2)$	$O(nlog(n))$	$O(nlog(n))$
Average Case	$O(n^2)$	$O(n^2)$	$O(nlog(n))$	$O(nlog(n))$
Worst Case	$O(n^2)$	$O(n^2)$	$O(nlog(n))$	$O(n^2)$

---

Now we’ll look at famous searching algorithms. See you in the next lesson!