Introduction to Algorithms - Info and Reading Options
By Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein
"Introduction to Algorithms" was published by MIT Press in 1990 - Cambridge, Mass, the book is classified in bibliography genre, it has 1028 pages and the language of the book is English.
“Introduction to Algorithms” Metadata:
- Title: Introduction to Algorithms
- Authors: Thomas H. CormenCharles E. LeisersonRonald L. RivestClifford Stein
- Language: English
- Number of Pages: 1028
- Publisher: MIT Press
- Publish Date: 1990
- Publish Location: Cambridge, Mass
- Genres: bibliography
- Dewey Decimal Classification: 005.1
- Library of Congress Classification: QA76.6 .C662 1990QA76.6.C662 1990
“Introduction to Algorithms” Subjects and Themes:
- 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, programming
Edition Specifications:
- Number of Pages: xvii, 1028 p. : ill. ; 26 cm.
- Pagination: xvii, 1028 p. :
Edition Identifiers:
- The Open Library ID: OL2194069M - OL4781294W
- Online Computer Library Center (OCLC) ID: 20219489
- Library of Congress Control Number (LCCN): 89013027 - ^^^89013027^//r91
- ISBN-13: 9780070131439 - 9780262031417 - 9780262530910
- ISBN-10: 0262031418 - 0070131430
- All ISBNs: ➤ 0262031418 - 0070131430 - 0262530910 - 9780070131439 - 9780262031417 - 9780262530910
AI-generated Review of “Introduction to Algorithms”:
"Introduction to Algorithms" Table Of Contents:
- 1- Growth of functions
- 2- Summations
- 3- Recurrences
- 4- Sets, etc.
- 5- Counting and probability
- 6- Heapsort
- 7- Quicksort
- 8- Sorting in linear time
- 9- Medians and order statistics
- 10- Elementary data structures
- 11- Hash tables
- 12- Binary search trees
- 13- Red
- 14- lack trees
- 15- Augmenting data structures
- 16- Dynamic programming
- 17- Greedy algorithms
- 18- Amortized analysis
- 19- B
- 20- rees
- 21- Binomial heaps
- 22- Fibonacci heaps
- 23- Data structures for disjoint sets
- 24- Elementary graph algorithms
- 25- Minimum spanning trees
- 26- Single
- 27- ource shortest paths
- 28- All
- 29- airs shortest paths
- 30- Maximum flow
- 31- Sorting networks
- 32- Arithmetic circuits
- 33- Algorithms for parallel computers
- 34- Matrix operations
- 35- Polynomials and the FFT
- 36- Number
- 37- heoretic algorithms
- 38- String matching
- 39- Computational geometry
- 40- NP
- 41- ompleteness
- 42- Approximation algorithms.
"Introduction to Algorithms" Description:
Harvard Library:
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. --
Read “Introduction to Algorithms”:
Read “Introduction to Algorithms” by choosing from the options below.
Search for “Introduction to Algorithms” downloads:
Visit our Downloads Search page to see if downloads are available.
Borrow "Introduction to Algorithms" Online:
Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.
- Is Online Borrowing Available: Yes
- Preview Status: restricted
- Check if available: The Open Library & The Internet Archive
Find “Introduction to Algorithms” in Libraries Near You:
Read or borrow “Introduction to Algorithms” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Introduction to Algorithms” at a library near you.
- Harvard University Library: Location: John G. Wolbach Library, Harvard-Smithsonian Center for Astrophysics - Cabot Science Library, Harvard University - Shelf Numbers: QA76.6 .C662 1990
Buy “Introduction to Algorithms” online:
Shop for “Introduction to Algorithms” on popular online marketplaces.
- Ebay: New and used books.