第八章程序查找（The eighth chapter program search）.docVIP

第八章程序查找（The eighth chapter program search） 8.4 application problems The 1. order lookup time is O (n), the dichotomy search time is O (log2n), and the hash method is O (1). Why is there efficient search method, and the inefficient method is not abandoned? [answer] different search methods have different scope of application, efficient search method is not in all cases than other search methods are more efficient, and not in all cases can be used. 2. pairs of N containing different elements of the set, while looking for the maximum and minimum elements at least how many comparisons? [answer] n-1 times [analysis] the variables Max and min are used to store the maximum element and the minimum element (location), and the first two elements are compared. The larger one is put into max, and the smaller one is put into min. From the beginning of second, each taking a first element and Max, if more than max to replace it with Max, and the end of the comparison; if less than max is compared with min, in the best case, it doesnt compare with min, so in this case, at least. N-1 comparison will find the maximum and minimum yuan yuan. 3. if the order table and unordered order table with n elements are searched sequentially, the average search length of the two in equal probability is discussed respectively in the following two cases: (1) find unsuccessful, that is, no keyword in the table equal to the record of the given value K; (2) find success, that is, the key in the table is equal to the record of the given value K. [answer] (1) n+1 comparisons are needed when unsuccessful (2) the average success time was (n+1) /2 times [parsing] when ordered and unordered tables are searched sequentially, n+1 comparisons are needed to determine the lookup failure. So the average search length is n+1. When looking for success, the average lookup length is (n+1) /2, and the ordered table and unordered table are the same. Because the order lookup is independent of the initial sequence state o