Math — Sorting Complexity
Time complexity of sorting algorithms.
Rendering…
Make it your own.
\text{bubble / insertion: } O(n^2)
\text{merge / heap: } O(n\log n)
\text{quicksort: } O(n\log n)\ \text{average}
\text{comparison-sort bound: } \Omega(n\log n)