An Introduction to the Analysis of Algorithm

An Introduction to the Analysis of Algorithm

By: Michael Soltys (author)Hardback

1 - 2 weeks availability


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.

Create a review


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

Product Details

  • publication date: 12/02/2009
  • ISBN13: 9789814271400
  • Format: Hardback
  • Number Of Pages: 152
  • ID: 9789814271400
  • weight: 408
  • ISBN10: 9814271403

Delivery Information

  • Saver Delivery: Yes
  • 1st Class Delivery: Yes
  • Courier Delivery: Yes
  • Store Delivery: Yes

Prices are for internet purchases only. Prices and availability in WHSmith Stores may vary significantly