Introduction to algorithms
by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
- 581 Want to read
- 35 Currently reading
- 33 Have read
The book covers a broad range of algorithms in depth, yet makes their design and analysis acessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.
Check nearby libraries
Buy this book
Previews available in: English
Subjects
Algorithms, Computer algorithms, Computer programming, open_syllabus_project, Programming, Algorithmes, Programmation (Informatique), 54.10 theoretical informatics, Algorithmus, Informatik, Theoretische Informatik, Algorithmentheorie, COMPUTER PROGRAMS, PROGRAMMING LANGUAGES, FILE MAINTENANCE (COMPUTERS), SOFTWARE TOOLS, Long Now Manual for Civilization, COMPUTERS, Open Source, Software Development & Engineering, Tools, General, Algorithmische Programmierung, Algoritmen, Datenstruktur, Datoralgoritmer, Datastrukturer, Компьютеры//Алгоритмы и структуры данных, Компьютеры, Алгоритмы и структуры данных, Algorithms and Data Structures, Qa76.6 .c662 2009, 005.1, 54.10, Qa76.6 .i5858 2001, Electronic digital computers, programmingShowing 4 featured editions. View all 18 editions?
| Edition | Availability |
|---|---|
1
|
zzzz
|
2
|
aaaa
|
3
Introduction to Algorithms, Second Edition
July 16, 2001, McGraw-Hill Science/Engineering/Math
in English
0070131511 9780070131514
|
zzzz
|
4
|
eeee
|
Book Details
Edition Notes
Includes bibliographical references (p. [1127]-1130) and index.
Rev. ed. of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990.
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Source records
- Scriblio MARC record
- Ithaca College Library MARC record
- Internet Archive item record
- Internet Archive item record
- Internet Archive item record
- Internet Archive item record
- OpenLibraries-Trent-MARCs record
- Internet Archive item record
- amazon.com record
- Better World Books record
- Library of Congress MARC record
- Internet Archive item record
- marc_nuls MARC record
- marc_columbia MARC record
- ISBNdb
- Harvard University record
Work Description
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. --
Community Reviews (0)
Lists
History
- Created April 1, 2008
- 24 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
| August 13, 2025 | Edited by MARC Bot | import existing book |
| March 28, 2025 | Edited by ImportBot | Redacting ocaids |
| December 19, 2023 | Edited by ImportBot | import existing book |
| November 14, 2023 | Edited by MARC Bot | import existing book |
| April 1, 2008 | Created by an anonymous user | Imported from Scriblio MARC record |