西安电子科技大学计算机学院算法分析与设计 Chapter8.pdfVIP

Design and Analysis of Algorithms Sorting in linear time Reference: CLRS Chapter 8 Topics: • Lower bound for sorting • Counting sort • Radix sort • Bucket sort Huo Hongwei 1 How fast can we sort? • All the sorting algorithms we have seen so far are comparison sorts: only use comparisons to determine the relative order of elements. – E.g., insertion sort, merge sort, quicksort, heapsort. – The best worst-case running time that we’ve seen for comparison sorting is O(n