SEARCHING (搜索）.pptVIP

Chapter7. Searching (搜索） 7.1 Introduction The Problem Search may succeed if there exists one record with the same key. There may be more than one record with the same key. In this case, return the first one. Search may fail if there is no record with the given key. Time complexity of the search algorithm: we count how many times one key is compared with another during a search. Internal searching: all the records are kept in high-speed memory. External searching, most of the records are kept in disk files. Assumptions Parameters for Search Functions 7.2 Sequential Search Algorithm Analysis Testing How to count? Definition of the class Key The class Record Choice of test data The test program Sequential search 7.3 Binary Search 7.3.1 Ordered Lists Implementation of ordered lists Overload insertion Overloaded insertion Binary Search The forgetful Version Algorithm Verification Termination Adjust the parameters Nonrecursive version Comparison Trees Analysing binary search Search terminates at leaves, half are successful and half are unsuccessful; All leaves are on the two adjacent levels; Worst case: the number of comparisons is the height of the tree; Average case? Comparison count 2-trees Some notations Analysis of binary_search_1 The maximum number of key comparisons is t = ?lg 2n?, approximately lg n +1; The average number of comparisons is about lg n +1; Lower Bounds Observations on 2-trees 本章要点 Exercises The recursion continue when top bottom. So we prove that the size of the interval [bottom, top] strictly decreases. When bottom top, we have bottom = mid top 2. The recursive calls reduce the size of the intervals either to top – (mid+1) or mid – bottom Both of which are strictly less then top – bottom. So the recursion terminates. We can adjust the above function to our standard search function conventions: Error_code run_recursive_binary_1(const Ordered_list the_list, const Key target, int position) { return