第七章快速排序.pptVIP

Quick sort（快速排序） 主要内容 Quick sort快速排序 Quick sort’s idea--Divide and Conquer Quick sort’s idea--Divide and Conquer Partitioning subroutine划分子程序 Example of Partitioning Analysis of quicksort Worst-case of quicksort Worst-case recursive tree Best Case Partitioning对等划分 Best-case analysis A Recursion tree Quicksort VS. Mergesort Which is better? Test environment: IBM370/158 Programming in PL/1 Input consists of random integers range in (0, 10000) Quicksort平均时间分析 Quicksort平均时间分析 Quicksort平均时间分析 Randomize-Partitioning Randomized quick sort algorithm 思考题 7.2-2,3 7.4-2,3 * * （一种算法设计技术） Quick sort快速排序 Randomized quick sort algorithm随机版本快速排序算法 Efficient sorting algorithm --Proposed by C.A.R. Hoare in 1962 --Divide-and-Conquer algorithm --Sorts “in place” (like insertion sort, but not like merge sort) --Very practical (with tuning) --Can be viewed as a randomized Las Vegas algorithm --Worst-case running time: Θ(n2) --Expected running time: Θ(nlogn) --Constant hidden in Θ(nlogn) are small. Quicksort an n-element array: --Divide: Partition the array into two subarrays around a pivot x such that elements in lower subarray≤x≤ elements in upper subarray --Conquer: Recursively sort the subarrays. --Combine: Trivial. Key point: Linear-time partitioning subroutine. Initial call Quicksort(A, 1, n) A[p,…,i]:known to be ≤ pivot A[i+1,…,j-1]:known to be pivot A[j…r-1]:not yet examined A[r]:pivot The operation of Partition on a sample array. Lightly shaded array elements are all with values no greater than x (the pivot). Heavily shaded array elements are all with values greater than x. Assume all input elements are distinct In practice, there are better partitioning algorithms for when duplicate input elements may exist Let T(n) = worst-case running time on an array of n elements Input sorted or reverse sorted已有序 Partition around min or max element One side of partition always has no elements T(n) = T(n - 1) + T(0)