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

  • 7
  • 0
  • 约3.18万字
  • 约 56页
  • 2019-05-05 发布于广东
  • 举报

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

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

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档