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.
Betaal eenvoudig met kaart, Klarna, Apple Pay of Google Pay. Niet tevreden? Je hebt altijd 14 dagen bedenktijd. Lees meer in onze voorwaarden. Heb je vragen, mail ons dan via hello@memmo.org.
Memmo maakt studeren makkelijker – waar je ook bent ter wereld. Wij brengen je cursusboeken en slimme studietools samen op één plek: samenvattingen, quizzen, podcasts en flashcards. En Ted, je studievriend die antwoord geeft op alles wat je je afvraagt. Meer dan 50.000 studenten studeren hier al – gebouwd om je sneller te laten leren en minder stress te geven.