Skip to main content
Stepwise
/
Concepts
/
Worst-case Analysis
1 / 5
Speed
EN
ES
Worst-case Analysis — Concepts
O(1)
O(log log n)
O(log n)
O(√n)
O(n)
O(n log log n)
O(n log n)
O(n²)
O(2^n)
O(n!)
Step 1:
Average-case quicksort looks like O(n log n): partitions are reasonably balanced.