Ch5-algorithm.pptVIP

P223 No.4 Eg3. Binary Search Algorithm二分查找; 二分搜索 对半查找 5-* Figure 5.12 Applying our strategy to search a list for the entry John 5-* Figure 5.13 A first draft of the binary search technique 5-* Figure 5.14 The binary search algorithm in pseudocode 5-* Recursion递归 The execution of a procedure leads to another execution of the procedure. Multiple activations of the procedure are formed, all but one of which are waiting for other activations to complete. 程序调用自身的编程技巧称为递归( recursion)。 能采用递归描述的算法通常有这样的特征：为求解规模为N的问题，设法将它分解成规模较小的问题，然后从这些小问题的解方便地构造出大问题的解，并且这些规模较小的问题也能采用同样的分解和综合方法，分解成规模更小的问题，并从这些更小问题的解构造出规模较大问题的解。特别地，当规模N=1时，能直接得解。 注意： (1) 递归就是在过程或函数里调用自身; (2) 在使用递增归策略时，必须有一个明确的递归结束条件，称为递归出口 P232 No.1,3 5-* Chapter 5: Algorithms 5.1 The Concept of an Algorithm 5.2 Algorithm Representation 5.3 Algorithm Discovery 5.4 Iterative Structures 5.5 Recursive Structures 5.6 Efficiency and Correctness Efficiency and correctness You can develop a variety of algorithms to solve the same problem. However, the choice between efficient and inefficient algorithms can make the difference between a practical solution to a problem and an impractical one. ?Time and storage complexity of the algorithm 5-* Algorithm Efficiency复杂性 Measured as number of instructions executed Example 30，000 students registered in a collage. And it means there are 30,000 records in the system. If university registrar needs to find one particular student, how long does it cost ? Using sequential searching Best case : the first student worst case : search the whole list. The target student is the last one in the list. Average case : the target student is in middle of list. search half students list If each 10 millisecond (毫秒10X10-3)required to search each record: Using binary search Worst case : first time need to search 15,000 records. Then 7,500 records . 3,750 .. Total need at most 15 times to finish the search. How long ? 15X10 X10-3 Compare (if list length is n) Sequential search Worst case : n