Let6-Quick Sort.ppt

1 Simple Review Heap Sort Heaps MAX-HEAPIFY BUILD-MAX-HEAP HEAPSORT Priority Queues MAXIMUM(S) EXTRACT-MAX(S) INCREASE-KEY(S,x,k) INSERT(S, x) Applications Design and Analysis of Algorithms Quicksort (Ch7) Quicksort VS. Mergesort Which is better? Test environment: IBM370/158 Programming in PL/1 Input consists of random integers range in (0, 10000) Homework 7.2-2 *Software School of XiDian University *Software School of XiDian University Design and Analysis of Algorithms Quicksort Topics: Quicksort Randomized quicksort algorithms Randomized algorithm Randomized algorithms: algorithms that flip coins --Applications Quicksort Discovering common motif in DNA sequence in computational biology Algorithms that make random decisions That is: --Can generate a random number x from some range {1,r} --Make decisions based on the value of x Why would it make sense? Two cups, one coin If you always choose a fixed cup, the adversary will put the coin in the other one, so the expected payoff=$0 If you choose a random cup, the expected payoff=$0.5 Randomized algorithm Two basic types: --Typically fast (but sometimes slow): Las Vegas --Typically correct (but sometimes output garbage): Monte Carlo The probabilities are defined by the random numbers of the algorithm! (not by random choices of the problem instances) Quicksort 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. Divide and Conquer 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 subarray