Evaluating Search Methods Analytically

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 indicates the strengths and weaknesses of each algorithm.

Authors

• Paul W. Purdom Jr.

Keywords

No keywords are indexed for this paper.