Introduction to Algorithms 3rd Edition by Cormen, Leiserson, Rivest & Stein (2009)

Introduction to Algorithms, 3rd Edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein is the essential algorithms text and professional reference used in universities worldwide. Published by MIT Press, this text uniquely combines rigor and comprehensiveness, covering a broad range of algorithms in depth while making their design and analysis accessible to readers at all levels.

The book covers algorithms in a way that each chapter is relatively self-contained and can be used as a unit of study. Algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming, keeping explanations elementary without sacrificing depth of coverage or mathematical rigor.

The third edition has been revised and updated throughout, including two completely new chapters on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrences, and new material on dynamic programming, greedy algorithms, and approximation algorithms. Core topics include sorting and order statistics, data structures, advanced design techniques, graph algorithms, and selected topics in NP-completeness.

The definitive reference for students in computer science, software engineering, and mathematics programs, and essential preparation for FAANG technical interviews, competitive programming, and graduate-level algorithms coursework.

ISBN-13: 978-0262033848