Let2-Getting Started.pptVIP

Design and Analysis of Algorithms Getting Started(Ch2) Software School ZhangLiyong Importance of algorithms Problem: sorting 10,000,000 integers Case 1: Computer A executes one billion instructions per second(1GHz), an algorithm taking time roughly equal to 2n2 to sort n integers. Case 2: Computer B executes one hundred million instructions per second(100MHz), an algorithm taking time roughly equal to 50nlgn to sort n integers. Importance of algorithms About the Course Design and Analysis How can I propose an algorithm for a specific problem? Is the algorithm good enough? Simple Review Insertion Sort Analysis Proving correctness using loop-invariants RAM model of computation We discussed how we are normally only interested in growth of running time: Best-case linear in O(n), worst-case quadratic in O(n2) Divide and Conquer General Method Merge Sort Mathematical induction. Powerful and general proof technique in discrete mathematics. To prove a theorem true for all integers k≥0: Base case: prove it to be true for n = 0; Induction hypothesis: assuming it is true for arbitrary n Induction step: show it is true for n+1 Claim: 0 + 1+ 2+3 + … + n = n(n + 1)/2 for all n≥0 Proof: (by mathematical induction) Base case (n=0) 0 = 0(0+1)/2 Induction hypothesis: assume 0 + 1 + 2 + … + n = n(n+1) / 2 Induction step: 0 + 1 + 2 + … + n + n + 1 = n(n+1) / 2 + n + 1 = (n+1)(n+2)/2 Homework 2.1-1，2.1-3，2.2-1，2.3-1，2.3-7 INPUT: a sequence of n numbers stored in array A OUTPUT: an ordered sequence of n numbers Merge-Sort (A, p, r) Merge (A, p, q, r) R INPUT: a sequence of n numbers stored in array A OUTPUT: an ordered sequence of n numbers Merge-Sort (A, p, r) Merge (A, p, q, r) R 10 26 22 20 3 V (1) (4) (3) (2) (1) L/R 16 14 12 (4) (3) (2) i=1 j=1 k=9 i=1 j=1 k=9 V (13) (12) (11) (10) (9) A (16) (15) (14) 3 Action of Merge 3