-
Anglický jazyk
An Introduction to the Analysis of Algorithms
Autor: Michael Soltys
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,... Viac o knihe
Na objednávku, dodanie 2-4 týždne
45.72 €
bežná cena: 50.80 €
O knihe
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.
- Vydavateľstvo: World Scientific
- Rok vydania: 2009
- Formát: Hardback
- Rozmer: 235 x 157 mm
- Jazyk: Anglický jazyk
- ISBN: 9789814271400
