As with earlier editions, the third edition of Introduction to Algorithms maintains the same level and quality of instruction in a relatively straightforward manner. The book, co-authored by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, has been extremely beneficial for people looking to master a sophisticated set of algorithms in a way that has never been possible before.
An Introduction to Algorithms maintains a firm grasp on the subject, skillfully guiding novice programmers through the process of learning new programming techniques and implementing them for a variety of reasons.
Following in the footsteps of earlier versions, the third edition of An Introduction to Algorithms covers the most often used computer algorithms by today’s programmers. The book contains the necessary information regarding algorithms and data structures, which will enable you to apply them for a range of tasks such as sorting, string processing, and graph processing. In other words, the third edition of An Introduction to Algorithms encompasses all a computer programmer needs to know about Algorithms.
Authors Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
Thomas Cormen, Ronald Rivest, and Charles Leiserson are among the genre’s top writers. Each author holds a prestigious position in the Department of Computer Science at their respective universities and is passionate about sharing their knowledge through publications.
Introduction to Algorithms Features
- The book is most frequently referred to when discussing published papers on computer algorithms.
- MIT Press published the third edition of An Introduction to Algorithms in 2009.
- Its first edition was published in 1990 and has since sold over half a million copies.
- Introduction to Algorithms is the most widely used textbook for all algorithms courses.