Introduction To The Analysis Of Algorithms, An

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.

List of contents

Preliminaries; Greedy Algorithms; Divide and Conquer; Dynamic Programming; Randomized Algorithms; Online Algorithms.

Product details

• Authors: Michael Soltys, Michael Soltys, Michael Soltys-kulinicz
• Publisher: Ingram Publishers Services
• Languages: English
• Product format: Hardback
• Released: 19.10.2009
• EAN: 9789814271400
• ISBN: 978-981-4271-40-0
• Subjects: Guides; Natural sciences, medicine, IT, technology > IT, data processing > IT; MATHEMATICS / Discrete Mathematics, Maths for computer scientists