next up previous
Next: Summary of Comparison Sorts Up: CSE 2320: Algorithms and Previous: Worst Case

Best Case

Partition yields subarrays of size n/2 each.

T(n) = 2T(n/2) + $\Theta(n)$
T(n) = \(\Theta(n lg n)\)



Average Case



\(\Theta(n lg n)\)



Copyright © 1998 The University of Texas at Arlington