An Intro to the Analysis of Algorithms (Hardcover) (ISBN-13: 9789814271400)

This textbook covers the mathematical foundations of the analysis of algorithms. The gist of the book is how to argue, without the burden of excessive formalism, that a given algorithm does what it is supposed to do. The two key ideas of the proof of correctness, induction and invariance, are employed in the framework of pre/post-conditions and loop invariants.The algorithms considered are the basic and traditional algorithms of computer science, such as Greedy, Dynamic and Divide & Conquer. In addition, two classes of algorithms that rarely make it into introductory textbooks are discussed. Randomized algorithms, which are now ubiquitous because of their applications to cryptography; and Online algorithms, which are essential in fields as diverse as operating systems (caching, in particular) and stock-market predictions.This self-contained book is intended for undergraduate students in computer science and mathematics.

Author: Michael Soltys-Kulinicz
ISBN-10: 9814271403
ISBN-13: 9789814271400
Publisher: World Scientific Publishing Company
Language: English
Published: 11/01/2009
Pages: 152
Format: Hardcover
Weight: 0.90lbs
Size: 9.00h x 6.10w x 0.70d

Review Citation(s):
Reference and Research Bk News 02/01/2011 pg. 242