There are books on algorithms that are rigorous but not complete and books that cover masses of material but are not rigorous. Introduction to Algorithms combines the attributes of comprehensiveness and comprehensibility. It will be equally useful as a text, a handbook, and a general reference. Introduction to Algorithms covers both classical material and such modern developments as amortized analysis and parallel algorithms. The mathematical exposition, while rigorous, is carefully detailed so that it will be accessible to all levels of readers. Chapters are organized so that they start with elementary material and progress to more advanced topics. Each chapter is relatively self-contained and can be used as a unit of study. Algorithms are presented in a pseudocode that can be easily read by anyone familiar with Fortran, C, or Pascal. Numerous pertinent examples, figures, exercises, and case-study problems emphasize both engineering and mathematical aspects of the subject.

"About this title" may belong to another edition of this title.

Store Description

We offer a wide variety of books including fiction and non-fiction titles.

Visit Seller's Storefront

Seller's business information

SBYB, Inc.
900 Knell Rd, Montgomery, IL, 60538, U.S.A.

Sale & Shipping Terms

Terms of Sale

We guarantee the condition of every book as it's described on the Abebooks web sites. If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

Shipping Terms

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.