Ch07-序.pptVIP

排序 高文宇 gwyy@163.com §1 预备知识 §2 插入排序 §3 简单排序算法的下界 定义：An inversion in an array of numbers is any ordered pair ( i, j ) having the property that i j but A[i] A[j]. 示例：Input list 34, 8, 64, 51, 32, 21 has inversions. (34, 8) (34, 32) (34, 21) (64, 51) (64, 32) (64, 21) (51, 32) (51, 21) (32, 21). There are 9 swaps needed to sort this list by insertion sort. Because Swapping two adjacent elements that are out of place removes exactly one inversion. 定理1：The average number of inversions in an array of N distinct numbers is N ( N ? 1 ) / 4. 定理2：Any algorithm that sorts by exchanging adjacent elements requires ? ( N2 ) time on average. §4 Shellsort ---- by Donald Shell Shell排序 Shell排序的时间复杂度分析 定理7.3：使用Shell增量时Shell排序的最坏情形运行时间为?(N2). 定理7.4：使用Hibbard增量时Shell排序的最坏情形运行时间为?(N3/2). 注1：使用Hibbard增量时Shell排序的平均情形运行时间基于模拟的结果被认为是O(N5/4)。但没人能证明该结果。 注2：使用Sedgewick提出的几种增量序列时，Shell排序的最坏情形运行时间为O(N4/3)，平均情形运行时间猜测为O(N7/6)。其中最好的序列是{1,5,19,41,109,…}。 注3：Shell排序是算法简单，但复杂性分析极其复杂的一个例子。 §5 堆排序 T ( N ) = O ( N log N ) ? The space requirement is doubled. 堆排序—大顶堆 定理：The average number of comparisons used to heapsort a random permutation of N distinct items is 2N log N ? O( N log log N ) . §6 Mergesort 归并排序 Merge 归并排序分析 §7 快速排序 快速排序的最坏情形分析 T( N ) = T( i ) + T( N – i – 1 ) + c N 最坏情形下，T( N ) = T( N – 1 ) + c N = O( N2 ) 改进最坏情形 三数取中 快速排序程序 快速排序分析 选择问题的线性时间算法 §8 大型结构的排序 Problem: Swapping large structures can be very much expensive. Solution: Add a pointer field to the structure and swap pointers instead – indirect sorting. Physically rearrange the structures at last if it is really necessary. §9 排序的一般下界 定理：Any algorithm that sorts by comparisons only must have a worst case computing time of ?( N log N ). 证明： When sorting N distinct elements, there are N! different possible results. Thus any decision tree must have at least N! leaves. §10 桶排序 问题：Suppose that we have N students, each has a grade record in the range 0 to 100 (thus there are M = 101 possible distinct grades). How to s