c++数据结构ppt(Chapter3).pptVIP

穷举法 定义 对可能是解的众多候选解,按某种顺序进行逐一枚举和检验，找出符合要求的候选解,作为问题的解。 例如 顺序查找 贪心法 定义 从问题的某一个初始解出发逐步逼近给定的目标，以尽可能快地求得更好的解。当达到某算法中的某一步不能继续前进时，算法停止。这时得到了问题的一个解，但不能保证求得的最后解是最优的。 例如 着色问题（求出最少要几种颜色，可将图中所有国家着色，使任意两个相邻的国家颜色都不相同） 回溯法 定义 一步一步向前试探,当有多种选择时任意选择一种，只要可行就继续向前,一旦失败就后退，回到上一步重新选择。 例如 八皇后问题 The 8-Queens Example The 8-Queens Example (Cont…) The 8-Queens Example (Cont…) 分治法 定义 把一个规模较大的问题,分成多个较小的与原问题相似的子问题。首先对子问题求解，再把子问题的解合并起来,得到整个问题的解。 例如 二分查找 实现 迭代算法/递归算法 Selection Sort- 5 Element Array Pass 0: Scan the entire list from arr[0] to arr[4] and identify 20 at index 1 as the smallest element. Exchange 20 with arr[0] = 50, the first element in the list. Selection Sort- 5 Element Array Pass 1: Scan the sublist 50, 40, 75, and 35. Exchange the smallest element 35 at index 4 with arr[1] = 50. Selection Sort- 5 Element Array Pass 2: Locate the smallest element in the sublist 40, 75, and 50. Selection Sort- 5 Element Array Pass 3: Two elements remain to be sorted. Scan the sublist 75, 50 and exchange the smaller element with arr[3]. The exchange places 50 at index 4 in arr[3]. Selection Sort- 5 Element Array Selection Sort Algorithm Selection Sort Algorithm Selection Sort Algorithm Search Algorithms Search algorithms start with a target value and employ some strategy to visit the elements looking for a match. If target is found, the index of the matching element becomes the return value. Sequential Search Sequential Search Algorithm Binary Search Binary Search Binary Search  Successful Binary Search Successful Binary Search Successful Binary Search Unsuccessful Binary Search Unsuccessful Binary Search Unsuccessful Binary Search Binary Search Algorithm Binary Search Algorithm Binary Search Algorithm Big-O notation Constant Time Algorithms Linear Time Algorithms Logarithmic Time Algorithms Quadratic and Cubic Algorithms Algorithms with running time O(n2) are quadratic. practical only for relative