算法分析与设计课件【荐】.pptVIP

1 The Role of Algorithms in Computing 1 what are algorithms? 2 why is the study of algorithms worthwhile? 3 what is the role of algorithms? The problem of sorting Input: sequence a1, a2, …, an of numbers. Output: permutation a‘1, a‘2, …, a‘n such that a 1 ≤ a 2 ≤ … ≤ a n . Example: 解释什么是实例？ Input: 8 2 4 9 3 6 Output: 2 3 4 6 8 9 Time Is Important Homework 1.1-3, 1.1-4 1.2 Algorithms as a technology Suppose computers were infinitely fast and computer memory was free. Would you have any reason to study algorithms? Compare the running time of insert sort and merge sort. Why study algorithms andperformance? ? Algorithms help us to understand scalability. ? Performance often draws the line between what is feasible and what is impossible. ? Algorithmic mathematics provides a language for talking about program behavior. ? Performance is the currency of computing. ? The lessons of program performance generalize to other computing resources. ? Speed is fun! 2 Getting Started Analysis of Algorithms Insertion Sort Merge Sort The problem of sorting Input: sequence a1, a2, …, an of numbers. Output: permutation a‘1, a‘2, …, a‘n such that a 1 ≤ a 2 ≤ … ≤ a n . Example: Input: 8 2 4 9 3 6 Output: 2 3 4 6 8 9 An Example: Insertion Sort InsertionSort(A, n) {for i = 2 to n { key = A[i] j = i - 1; while (j 0) and (A[j] key) { A[j+1] = A[j] j = j - 1 }  A[j+1] = key} } An Example: Insertion Sort InsertionSort(A, n) {for i = 2 to n { key = A[i] j = i - 1; while (j 0) and (A[j] key) { A[j+1] = A[j] j = j - 1 }  A[j+1] = key} } An Example: Insertion Sort InsertionSort(A, n) {for i = 2 to n { key = A[i] j = i - 1; while (j 0) and (A[j] key) { A[j+1] = A[j] j = j - 1 }  A[j+1] = key} } An Example: Insertion Sort InsertionSort(A, n) {for i = 2 to n { key = A[i] j = i - 1; while (j 0) and (A[j] key) { A[j+1] = A[j] j = j - 1 }  A[j+1] = key} } An Example: Insertion Sort InsertionSort(A, n) {for i = 2 to n { key = A[i] j