线性时间内排序探究.ppt

Page ? * Tel : Email : lipinggao@usst.edu.cn Office: room 612（新图书馆楼602房间） Chp8 Sorting in Linear Time * Introduction Comparison sort: the sorted order an algorithm determine is based only on comparisons between the input elements Any comparison must take ?(n lg n) comparisons in the worst case Merge sort and heapsort are asymptotically optimal Sorting in linear time Of course, use operations other than comparisons to determine the sorted order Counting sort, radix sort, and bucket sort * The Decision-Tree Model Decision tree A full binary tree that represents the comparis