算法设计与分析_基础篇(英文).ppt

Design and Analysis of Algorithms - Chapter 1 Algorithm An algorithm is a sequence of unambiguous instructions for solving a problem, i.e., for obtaining a required output for any legitimate input in a finite amount of time. Historical Perspective Euclid’s algorithm for finding the greatest common divisor Muhammad ibn Musa al-Khwarizmi – 9th century mathematician /science/parshall/khwariz.html Notion of algorithm Example of computational problem: sorting Statement of problem: Input: A sequence of n numbers a1, a2, …, an Output: A reordering of the input sequence a′1, a′2, …, a′n so that a′i ≤ a′j whenever i j Instance: The sequence 5, 3, 2, 8, 3 Algorithms: Selection sort Insertion sort Merge sort (many others) Selection Sort Input: array a[1],…,a[n] Output: array a sorted in non-decreasing order Algorithm: for i=1 to n swap a[i] with smallest of a[i],…a[n] Some Well-known Computational Problems Sorting Searching Shortest paths in a graph Minimum spanning tree Primality testing Traveling salesman problem Knapsack problem Chess Towers of Hanoi Program termination Basic Issues Related to Algorithms How to design algorithms How to express algorithms Proving correctness Efficiency Theoretical analysis Empirical analysis Optimality Algorithm design strategies Brute force Divide and conquer Decrease and conquer Transform and conquer Analysis of Algorithms How good is the algorithm? Correctness Time efficiency Space efficiency Does there exist a better algorithm? Lower bounds Optimality What is an algorithm? Recipe, process, method, technique, procedure, routine,… with following requirements: Finiteness terminates after a finite number of steps Definiteness rigorously and unambiguously specified Input valid inputs are clearly specified Output can be proved to produce the correct output given a valid input Effectiveness steps are sufficiently simple and basic Why study algorithms? Theoretical importance the core of computer science