Sponsored
Introduction to Algorithms, Fourth Edition - by Thomas H Cormen & Charles E Leiserson & Ronald L Rivest & Clifford Stein (Hardcover)
$150.00 when purchased online
Target Online store #3991
About this item
Highlights
- A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.
- About the Author: Thomas H. Cormen is Emeritus Professor of Computer Science at Dartmouth College.
- 1312 Pages
- Computers + Internet, Programming
Description
About the Book
"The leading introductory textbook and reference on algorithms"--Book Synopsis
A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout. New for the fourth edition- New chapters on matchings in bipartite graphs, online algorithms, and machine learning
- New material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays
- 140 new exercises and 22 new problems
- Reader feedback-informed improvements to old problems
- Clearer, more personal, and gender-neutral writing style
- Color added to improve visual presentation
- Notes, bibliography, and index updated to reflect developments in the field
- Website with new supplementary material
Warning: Avoid counterfeit copies of Introduction to Algorithms by buying only from reputable retailers. Counterfeit and pirated copies are incomplete and contain errors.
About the Author
Thomas H. Cormen is Emeritus Professor of Computer Science at Dartmouth College. Charles E. Leiserson is Edwin Sibley Webster Professor in Electrical Engineering and Computer Science at MIT. Ronald L. Rivest is Institute Professor at MIT. Clifford Stein is Wai T. Chang Professor of Industrial Engineering and Operations Research, and of Computer Science at Columbia University.Dimensions (Overall): 8.9 Inches (H) x 8.4 Inches (W) x 2.2 Inches (D)
Weight: 5.8 Pounds
Suggested Age: 22 Years and Up
Sub-Genre: Programming
Genre: Computers + Internet
Number of Pages: 1312
Publisher: MIT Press
Theme: Algorithms
Format: Hardcover
Author: Thomas H Cormen & Charles E Leiserson & Ronald L Rivest & Clifford Stein
Language: English
Street Date: April 5, 2022
TCIN: 83983176
UPC: 9780262046305
Item Number (DPCI): 247-06-8794
Origin: Made in the USA or Imported
If the item details above aren’t accurate or complete, we want to know about it.
Shipping details
Estimated ship dimensions: 2.2 inches length x 8.4 inches width x 8.9 inches height
Estimated ship weight: 5.8 pounds
We regret that this item cannot be shipped to PO Boxes.
This item cannot be shipped to the following locations: American Samoa (see also separate entry under AS), Guam (see also separate entry under GU), Northern Mariana Islands, Puerto Rico (see also separate entry under PR), United States Minor Outlying Islands, Virgin Islands, U.S., APO/FPO
Return details
This item can be returned to any Target store or Target.com.
This item must be returned within 90 days of the date it was purchased in store, shipped, delivered by a Shipt shopper, or made ready for pickup.
See the return policy for complete information.