14_split_Introduction to Algorithms 2nd Edition

14_split_Introduction to Algorithms 2nd Edition - technical...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Preface 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 mathemati- cal rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a “pseudocode” designed to be readable by anyone who has done a little programming. The book contains over 230 figures illustrating how the algorithms work. Since we emphasize effi- ciency 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
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 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. To the teacher This book is designed to be both versatile and complete. You will nd it useful for a variety of courses, from an undergraduate course in data structures up through a graduate course in algorithms. Because we have provided considerably more material than can t in a typical one-term course, you should think of the book as a buffet or smorgasbord from which you can pick and choose the material that best supports the course you wish to teach. You should nd it easy to organize your course around just the chapters you need. We have made chapters relatively self-contained, so that you need not worry about an unexpected and unnecessary dependence of one chapter on another. Each chapter presents the easier material rst and the more difcult material later, with...
View Full Document

This document was uploaded on 11/22/2010.

Ask a homework question - tutors are online