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 1999 - Cambridge, Mass, 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: 1999
- Publish Location: Cambridge, Mass
“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:
- Pagination: xvii, 1028 p. :
Edition Identifiers:
- The Open Library ID: OL18372918M - OL4781294W
- Online Computer Library Center (OCLC) ID: 44674539
- Library of Congress Control Number (LCCN): 89013027
- ISBN-10: 0262031418
- All ISBNs: 0262031418
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-black trees
- 14- Augmenting data structures
- 15- Dynamic programming
- 16- Greedy algorithms
- 17- Amortized analysis
- 18- B-trees
- 19- Binomial heaps
- 20- Fibonacci heaps
- 21- Data structures for disjoint sets
- 22- Elementary graph algorithms
- 23- Minimum spanning trees
- 24- Single-source shortest paths
- 25- All-pairs shortest paths
- 26- Maximum flow
- 27- Sorting networks
- 28- Arithmetic circuits
- 29- Algorithms for parallel computers
- 30- Matrix operations
- 31- Polynomials and the FFT
- 32- Number-theoretic algorithms
- 33- String matching
- 34- Computational geometry
- 35- NP-completeness
- 36- Approximation algorithms.
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.
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.
Buy “Introduction to Algorithms” online:
Shop for “Introduction to Algorithms” on popular online marketplaces.
- Ebay: New and used books.