数据结构与算法国家级双语教学示范课程配套教材彭军向毅Chap9searching课件教学.pptVIP

Table shows that three keys that collide at address 001, Next two collision probe addresses * any of the collision resolution methods may be used. * * * PPT研究院 POWERPOINT ACADEMY Array structure * * To discuss the list search algorithms using an array structure * Needs to tell the calling algorithm two things Find the data If it did, at what index Four parameters The list we are searching An index to the last element in the list The target The address where the found elements’s index location is to be stored * If you examine the search algorithm carefully, you will note that the loop tests two conditions, end of list and target not found If we know that the target will be found in the list, we can eliminate the test for the end of the list. The only way to ensure that a target is actually in the list is to put it there yourself. * * If the list is small it may be more efficient to use a sequential search. * Force begin to be greater than end. * Two conditions terminate the loop: The target is found begin becomes larger than end * This is a classic example of a linear algorithm. It is known as a linear search. Because the algorithm is linear, its efficiency is O(n). Although the sentinel search saves a few instructions in the loop, its design is identical. Therefore, it is also an O(n) search. Likewise, the efficiency of the ordered list search is also O(n). It is not possible to generalize the efficiency of probability search without knowing the probability of each element in the list. On the other hand, if the probability of the first few elements of a list totals more than 90%, it can be a very efficient search. The binary search locates an item by repeatedly dividing the list in half. This loop obviously divides, and it is therefore a logarithmic loop. The efficiency is thus O(log n), which you should recognize as one of the most efficient of all the measures. * The binary search tree: is actually a structure built to provide the efficiency of the bin