Evaluating search methods analytically
Paul Walton Purdom, Cynthia A. Brown · 1982
A unified approach to analyzing search algorithms is presented. Each algorithm is characterized by the types of random problems that it can solve rapidly. The results are displayed in a way that clearly indicabes the strengths and weaknesses of each algorithm. Many interesting problems can, at present, best be solved by search methods [7]. In the worst case, searching requires exponent ial time. Several clever techniques have been developed to speed up searching (see, for example, 11, 3,