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 Sort	Selection Sort	Merge Sort	Quick Sort	Bubble Sort	Insertion Sort
Best Case	Ω$(n)$	Ω$(n^2)$	Ω(nlog(n))	Ω(nlog(n))	Ω$(n^2)$	Ω$(n)$
Average Case	θ$(n^2)$	θ$(n^2)$	θ(nlog(n))	θ(nlog(n))	θ$(n^2)$	θ$(n^2)$
Worst Case	$O(n^2)$	$O(n^2)$	$O(nlog(n))$	$O(n^2)$	$O(n^2)$	$O(n^2)$