next up previous
Next: Decision Tree Model Up: l4 Previous: Sorting in Linear Time

Lower Bounds For Worst-Case Comparison Sorts

In general, assuming unique inputs, comparison sorts are expressed in terms of \(a_i \leq a_j\) comparisons.



What is the best we can do on the worst case type of input?

What is the best worst-case running time?


next up previous
Next: Decision Tree Model Up: l4 Previous: Sorting in Linear Time