Algorithms  (English, Paperback, Dasgupta Sanjoy)

The most complex mathematical algorithms are now made easy thanks to Algorithms by Sanjoy Dasgupta, Christos Papadimitriou, and Umesh Vazirani. From mathematical processes, global information, graph processing models to application and classic implementations, this book provides an in-depth analysis for each level.

Summary Of The Book

Algorithm may appear challenging, but with the guidance of Dasgupta’s Algorithms the most complex problems are rendered easily solvable. This is a practical guide to using the algorithms for students and professionals alike. Students will find it easier to understand the basic concepts behind every mathematical algorithm.

There can be no doubt about the importance of algorithms in the field of science, applied physics, engineering and programming. While some may think that these have no function in real life, one can’t be far from truth. This book does not just deal with the classic powerful problems of algorithms but also the latest ones. This allows students with a better understanding of complicated problems and increase efficiency in solving these problems.

This is a highly popular work on some of the most classic algorithms that are rendered straightforward for every student. Dasgupta has provided the necessary tools with the help of which one can improve mathematical problem-solving abilities and decrease issues associated with it.

One has to realize that math is solved not through memorizing formulae but by intuition and this is possible by going through Algorithms. The unique feature of this book is the comprehensive look into design rationales and issues as well as the alternative solutions provided. There are different perspectives stated regarding the design of algorithms which have been thoroughly tested in the University of California, Berkeley for over a decade.

Students and teachers alike have found this a practical and resourceful book for anyone seeking to understand complex algorithms and be able to comprehend through the Solutions Manual provided. Dasgupta’s book also provides a lot of mathematical problems and solutions along with the algorithms. There are references made to computing, engineering, physics, web navigation and data compression. There are detailed insights on performance and implementation as well.

The great thing about Algorithms is the way the chapters are arranged according to the fundamentals and types of problems faced. Students and professionals will find this book extremely valuable.

About The Authors

Sanjoy Dasgupta has been a professor of applied mathematics in the University of California, Berkeley and University of San Diego and has published works like Learning Probability Distributions and Learning Mixtures of Gaussians.

Christos Papadimitriou is professor of Computer science in the University of California, Berkeley. In 2002, he had won the Knuth Prize for excellence in his research field.

Umesh Vazirani is associated with the department of electrical engineering and computer science at the University of California, Berkeley. In 2012, he was awarded the Fulkerson Prize for his work on graph separators.