Promotional Information

Algorithms are at the center of computer science. This is a unique book in its attempt to open the field of algorithms to a wider audience. It provides an easy-to-read introduction to an abstract topic, without sacrificing depth. This is an important contribution and there is nobody more qualified than Thomas Cormen to bridge the knowledge gap between algorithms experts and the general public. -- Frank Dehne, Chancellor's Professor of Computer Science, Carleton University Thomas Cormen has written an engaging and readable survey of basic algorithms. The enterprising reader with some exposure to elementary computer programming will discover insights into the key algorithmic techniques that underlie efficient computation. -- Phil Klein, Professor, Department of Computer Science, Brown University Thomas Cormen helps readers to achieve a broad understanding of the key algorithms underlying much of computer science. For computer science students and practitioners, it is a great review of key algorithms that every computer scientist must understand. For non-practitioners, it truly unlocks the world of algorithms at the heart of the tools we use every day. -- G. Ayorkor Korsah, Computer Science Department, Ashesi University College

About the Author

Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. He is the coauthor (with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein) of the leading textbook on computer algorithms, Introduction to Algorithms (third edition, MIT Press, 2009).

Reviews

"Algorithms are at the center of computer science. This is a unique book in its attempt to open the field of algorithms to a wider audience. It provides an easy-to-read introduction to an abstract topic, without sacrificing depth. This is an important contribution and there is nobody more qualified than Thomas Cormen to bridge the knowledge gap between algorithms experts and the general public." -- Frank Dehne, Chancellor's Professor of Computer Science, Carleton University "Thomas Cormen has written an engaging and readable survey of basic algorithms. The enterprising reader with some exposure to elementary computer programming will discover insights into the key algorithmic techniques that underlie efficient computation." -- Phil Klein, Professor, Department of Computer Science, Brown University "Thomas Cormen helps readers to achieve a broad understanding of the key algorithms underlying much of computer science. For computer science students and practitioners, it is a great review of key algorithms that every computer scientist must understand. For non-practitioners, it truly unlocks the world of algorithms at the heart of the tools we use every day." -- G. Ayorkor Korsah, Computer Science Department, Ashesi University College