Time Complexities of Sorting Algorithms (Overview)

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	Bubble
Best case	$O(n)$	$O(n^2)$	$O(nlog(n))$	$O(nlog(n))$	$O(n)$
Average case	$O(n^2)$	$O(n^2)$	$O(nlog(n))$	$O(nlog(n))$	$O(n^2)$
Worst case	$O(n^2)$	$O(n^2)$	$O(nlog(n))$	$O(n^2)$	$O(n^2)$