Practical Analysis of Algorithms [Paperback]

This book introduces the essential concepts of algorithm analysis required by core undergraduate and graduate computer science courses, in addition to providing a review of the fundamental mathematical notions necessary to understand these concepts. Features: includes numerous fully-worked examples and step-by-step proofs, assuming no strong mathematical background; describes the foundation of the analysis of algorithms theory in terms of the big-Oh, Omega, and Theta notations; examines recurrence relations; discusses the concepts of basic operation, traditional loop counting, and best case and worst case complexities; reviews various algorithms of a probabilistic nature, and uses elements of probability theory to compute the average complexity of algorithms such as Quicksort; introduces a variety of classical finite graph algorithms, together with an analysis of their complexity; provides an appendix on probability theory, reviewing the major definitions and theorems used in the book.

Introduction.- Mathematical Preliminaries.- Fundamental Notations in Analysis of Algorithms.- Recurrence Relations.- Deterministic Analysis of Algorithms.- Algorithms and Probabilities.- Finite Graph Algorithms.- Appendix: Probability Theory.

This textbook is a practical approach to the analysis of algorithms from a programmers perspective. & This book therefore does play an important role for educating programmers on how to analyze the runtime requirements of their algorithms. & The authors are in essence talking to readers when presenting the material and take a step-by-step approach when presenting the mathematical proofs. & A one-semester course on the analysis of algorithms can be crafted based on the chapters of this text. (R. Goldberg, Computing Reviews, March, 2015)

Vrajitoru and Knight (both, Indiana Univ.) cover standard algorithmic problems from sorting to graph theory. The authors provide ready-to-run C++ programs for many oflĨ