Let me first thank you for considering this textbook. This book provides a comprehensive introduction to the modern study of computer alogorithms. Each chapter presents an algorithm, a design technique or a related topic. Algorithms are described to be readable by anyone who has done a little programming.
The text is intended primarly for use in undergraduate or graduate courses in algorithms or data structures.The book uses plain and lucid language to explain fundamentals of the subject. Each chapter is supported with necessary illustrations, practical examples. All the chapters in the book are arranged in a proper sequence that permits each topic to build upon earlier studies of this. All care has been taken to make students comfortable in understanding the basic concepts of the subject.
The book not only covers the entire scope of the subject but explains the philosophy of the subject. This makes the understanding of this subject clearer and makes it more interesting. This book is suitable for any computer science students.
- Fundamentals of the Analysis of Algorithm Efficiency
- Divide and Conquer
- Dynamic Programming
- Greedy Algorithms
- Searching and Sorting Techniques
- Limitation of Algorithms
- Polynomials and the FFT
- Number – Theoretic Algorithms
- String Matching
- NP – completeness
- Approximation Algorithms
- Elementary Graph Algorithms
- Minimum Spanning Trees
- Single – Source shortest Paths