This introductory textbook focuses on the design and analysis of algorithms. The author uses a careful selection of topics to illustrate tools for algorithm analysis, including mathematical preliminaries; recursive algorithms; algorithms in the theory of numbers; NP-completeness; and the network flow problem. The intended audience for this book includes mathematics or computer science majors at advanced undergraduate or beginning graduate levels, and anyone interested in the analysis of algorithms.