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

第八章程序查找（The eighth chapter search program） 8.4 application questions 1., the sequential search 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 inefficient methods are not abandoned? [answer] different search methods vary in scope. Efficient search methods are not always more efficient than other search methods in all cases, and they are not available in all cases. 2. pairs of N containing different elements of the collection, while looking for the maximum and minimum yuan, at least how many comparisons? [answer] n-1 times [analysis] the variables Max and min are used to store the maximum and minimum (location), the first to compare the two elements, large into max, small into the 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 ordered sequential table with n elements and unordered order table 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) finding 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 time of success was (n+1) /2 times [parse] when ordered and unordered tables are searched sequentially, n+1 comparisons are needed to determine the search failure. Therefore, the average lookup length is n+1. When searching for success, the average lookup length is (n+1) /2, and the ordered table and unordered table are the same. Because sequential lookups are independent of the initial sequence state of the table. 5. why not a