数据结构资料_chapter7.ppt

* * * * * * * * * Empirical Comparison * Sorting Lower Bound We would like to know a lower bound for all possible sorting algorithms. Sorting is O(n log n) (average, worst cases) because we know of al