Quick-Sort课件.pptVIP

How to Pick the Pivot (2/2) Strategy 3: Median of three Ideally, the pivot should be the median of input S, which divides the input into two sequences of almost the same length However, computing median takes O(n) So we find the approximate median via Pivot = median of the left-most, right-most, and the center element of the array S Quick-Sort * Example of Median of Three Let input S = {6, 1, 4, 9, 0, 3, 5, 2, 7, 8} left=0 and S[left] = 6 right=9 and S[right] = 8 center = (left+right)/2 = 4 and S[center] = 0 Pivot = median of {6, 8, 0} = 6 Quick-Sort * Dealing with Small Arrays For small arrays (say, N ≤ 20), Insertion sort is faster than quicksort Quicksort is recursive So it can spend a lot of time sorting small arrays Hybrid algorithm: Switch to using insertion sort when problem size is small (say for N 20) Quick-Sort * Quick-Sort * Summary of Sorting Algorithms Algorithm Time Notes selection-sort O(n2) in-place, stable slow (good for small inputs) insertion-sort O(n2) in-place, stable slow (good for small inputs) quick-sort O(n log n)expected in-place, unstable, randomized fastest (good for large inputs) heap-sort O(n log n) in-place, unstable fast (good for large inputs) merge-sort O(n log n) not in-place, stable fast (good for huge inputs) Quick-Sort * * Quick-Sort ? 2004 Goodrich, Tamassia ? 2004 Goodrich, Tamassia Quick-Sort Quick-Sort Quick-Sort Quick-Sort Quick-Sort Quick-Sort Quick-Sort Quick-Sort Quick-Sort Quick-Sort Quick-Sort Quick-Sort * Quick-Sort 7 4 9 6 2 ? 2 4 6 7 9 4 2 ? 2 4 7 9 ? 7 9 2 ? 2 9 ? 9 Quick-Sort Inventor Invented by Hoare in 1962 Quick-Sort * 查爾斯·安東尼·理察·霍爾爵士(Charles Antony Richard Hoare，縮寫為 C. A. R. Hoare，1934年1月11日－ )，生於斯里蘭卡可倫坡，英國計算機科學家，圖靈獎得主。他設計了可快速進行排序程序的快速排序(quick sort)演算法，提出可驗證程式正確性的霍爾邏輯(Hoare logic) 、以及提出可訂定並時程序(concurrent process)的交互作用(如哲學家用餐問題(dining philosophers problem)的交談循序程續(CSP, Communicating Sequential Processes)架構 。 (圖及說明摘自維基百科) About Quick-Sort Fastest known sorting algorithm in pract