How long does it take to read Introduction to Algorithms?
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein takes about 23 hours 41 minutes to read at 250 words a minute.
About 23 hours 41 minutes
A long haul
First published 1990. 1,292 pages, about 355,300 words.
48 days (about 7 weeks) at 30 minutes a day
Estimate based on 275 words per page.
At other speeds
| Slow, 150 words a minute | 39 hours 29 minutes |
| Average, 250 words a minute | 23 hours 41 minutes |
| Fast, 400 words a minute | 14 hours 48 minutes |
The page count is the median across 18 editions, so your copy may differ. How we calculate.
About the book
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. 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 260 figrues 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. --
Subjects: Algorithms, Computer algorithms, Computer programming, Programming, Algorithmes, Programmation (Informatique)
