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. Since we emphasize efficiency as a design criterion, we include careful analyses of the running times of all our algorithms.
The text is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Because it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for self-study by technical professionals.
In this, the second edition, we have updated the entire book. The changes range from the addition of new chapters to the rewriting of individual sentences. Algorithms for graphing problems used in such real-world business problems as optimizing flight schedules or flow through pipelines come next.
In each case, the authors provide the best from current research in each topic, along with sample solutions. Please contact the content providers to delete files if any and email us, we'll remove relevant links or contents immediately.
Login Join User. IT Certification Mathematics Physics. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Free Download Link1 Download Link 2.
0コメント