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.

Acerca del autor

Charlotte y Peter Fiell son dos autoridades en historia, teor�a y cr�tica del dise�o y han escrito m�s de sesenta libros sobre la materia, muchos de los cuales se han convertido en �xitos de ventas. Tambi�n han impartido conferencias y cursos como profesores invitados, han comisariado exposiciones y asesorado a fabricantes, museos, salas de subastas y grandes coleccionistas privados de todo el mundo. Los Fiell han escrito numerosos libros para TASCHEN, entre los que se incluyen 1000 Chairs, Dise�o del siglo XX, El dise�o industrial de la A a la Z, Scandinavian Design y Dise�o del siglo XXI.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.