Leiserson Ronald L. This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. We have tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic. The book contains over figures illustrating how the algorithms work.
This book also discusses the concept of NP-completeness before introducing approximation algorithms. Again, this is explained through examples which make sure that the students have a definite idea about this very abstract concept. In addition, this book also has a chapter on on-line algorithms.
Each on-line algorithm is introduced by first describing the basic principle behind it. Amortized analysis is a new field in algorithm research. In this book, detailed descriptions are given to introduce this new and difficult-to-understand concept.
Please note that the tricks or techniques listed in this pdf are either fictional or claimed to work by its creator. We do not guarantee that these techniques will work for you. Some of the techniques listed in Introduction to Algorithms may require a sound knowledge of Hypnosis, users are advised to either leave those sections or must have a basic understanding of the subject before practicing them.
DMCA and Copyright : The book is not hosted on our servers, to remove the file please contact the source url. If you see a Google Drive link instead of source url, means that the file witch you will get after approval is just a summary of original book or the file has been already removed.
Loved each and every part of this book. I will definitely recommend this book to science, computer science lovers.
0コメント