Introduction to Algorithms

Review of the book
The book Introduction to Algorithms can be called the “holy book” in the field of algorithms, which covers a wide range of modern algorithms. This book includes the fastest algorithms and data structures, algorithms with polynomial difficulty, classical algorithms in graph theory, computational geometry and number theory.

Each chapter of this book presents the algorithm, its design technique and practical application. All algorithms are provided to the readers in the form of written and pseudo code that can be followed by anyone. The book contains 244 figures that show how algorithms work. Due to the fact that the efficiency of the algorithms is very important, the solving time of the algorithms is investigated.

This book is primarily designed for undergraduate and graduate students in the fields of data structure and computer engineering. But since it tries to use real examples in its examples, it can be used as a self-study book for those interested.