Fundamentals Of Computer Algorithms written by Ellis Horowitz, Sanguthevar Rajasekaran, and Sartaj Sahni is essentially a book of reference on the topic of computer algorithms. This authoritative text is primarily meant for all those students who are studying for graduate level courses in computer algorithms. All the authors mentioned are considered experts in the field and bring their combined knowledge and acumen to benefit aspiring students.
Fundamentals of Computer Algorithms start with an introduction of the topic in question. Succeeding chapters describe such important concepts like Elementary Data Structures, Dynamic Programming, the Greedy Method, Algebraic Problems, Backtracking, Lower Bound Theory, Hypercube Algorithms, Pram Algorithms, and Mesh Algorithms.
Each and every algorithm presented in this book is analyzed closely and in great detail and ably supported by real-life examples. Topics such as parallel and probabilistic algorithms are also covered at length. And the variations that exist between randomized as well as non-randomized instances are duly highlighted.
The content of whole the text is supported by comprehensive research and also the most up-to-date advancements in this particular field. It is free of any particular programming language, with its emphasis on various design techniques instead of the algorithms as such.
Actually, this work is the second edition of the Fundamentals Of Computer Algorithms and was published by Universities Press, in 2008. With its thorough coverage of every theoretical as well as practical facet of algorithms, this book has become an invaluable font of knowledge in the field of contemporary education of computer science.
Other bestsellers from the author are Fundamentals Of Programming Languages, and co-author Fundamentals Of Data Structures In Pascal: Instructor's Solution Manual. You can shop online for this product. This paperback book is listed with the ISBN number of ISBN-13 978-8173716126 ISBN-10 8173716129.