计算机算法导论_第2章.ppt

Introduction to Algorithms 计算机算法导论 2007~2008年第一学期 Quiz(10 minutes) Question Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n2 steps, while merge sort runs in 64nlgn steps. For which values of n does insertion sort beat merge sort? What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine? 2、Getting Started Question Introducing the insertion sort algorithm to solve the solving problem Analyzing its running time Designing the algorithm by the divide-and-conquer approach 2.1、Insertion sort Problem Input: sequence a1, a2, …, an of numbers. Output: permutation a1, a2, …, ansuch that a1 ≤ a2 ≤ … ≤ an . Example: Input: 8 2 4 9 3 6 Output: 2 3 4 6 8 9 Pseudocode Difference between pseudocode and real code Pseudocode is more clear and concise Sometimes, in English Pseudocode is not typically concerned with issue of software engineering Pseudocode conventions Indentation indicates block structure The looping constructs while, for and repeat and the conditional constructs if, then and else have interpretations similar to those in Pascal The “ ” indicates a comment A multiple assignment Varibles are local to the given procedure A[1..j] Field [objects] indicates compound data, A variable representing an array or object is treated as a pointer, and NIL pointer Parameters are passed to a procedure by value The boolean operators is short circuiting Pseudcode 2.1、Insertion sort 1.1、Algorithms Correct and incorrect algorthms The specification of an algorthm In english A computer program A hareware design Loop invariants Initialization: It is true prior to the first iteration of the loop Maintenance: If it is true before an iteration, it remains true before the next iteration Termination: When the loop terminates, the invariant can helps show that the algorithm is correct The