You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in one of the groups: Users, Administrators.


You can view and copy the source of this page.

Return to Complexities of Basic Sorting Algorithms.

Algorithm Worst Case Average Case Best Case
Bubble $\theta(n^{2})$ $\theta(n^{2})$ $\theta(n^{2})$
Selection $\theta(n^{2})$ $\theta(n^{2})$ $\theta(n^{2})$
Insertion $\theta(n^{2})$ $\theta(n^{2})$ $\theta(n)$ \n(when array is sorted)
Quick $\theta(n^{2})$ (when array is sorted, and pivot taken from one end) $\theta(nlgn)$ $\theta(nlgn)$
Merge $\theta(nlgn)$ $\theta(nlgn)$ $\theta(nlgn)$
Heap $\theta(nlgn)$ $\theta(nlgn)$ $\theta(nlgn)$