Practical Analysis of Algorithms
Description
Reviews / Votes
"This textbook is a practical approach to the analysis of algorithms from a programmer's 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 of their algorithms. It is clear from the exercises and examples that this book's content has been used in teaching undergraduates for a number of years. . Summing Up: Recommended. Lower- and upper-division undergraduates and faculty." (P. Cull, Choice, Vol. 52 (10), June, 2015)
"The book is dedicated to an old, important and complex topic in computer science. . The multiple exercises in each section invite the readers to a deeper exploration of the subjects. The formalized style of the book is expected to attract especially young students introduced already to mathematical formalisms. The material can be used as a textbook for undergraduate courses in computer science." (Dana Petcu, zbMATH, Vol. 1303, 2015)More details
Other editions
Additional editions
Persons
Content
Introduction.- Mathematical Preliminaries.- Fundamental Notations in Analysis of Algorithms.- Recurrence Relations.- Deterministic Analysis of Algorithms.- Algorithms and Probabilities.- Finite Graph Algorithms.- Appendix: Probability Theory.
