Check nearby libraries
Buy this book
This edition doesn't have a description yet. Can you add one?
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 9 featured editions. View all 18 editions?
Edition | Availability |
---|---|
1
Introduction to Algorithms
2009, MIT Press
Paperback
in English
- Third edition
0262533057 9780262533058
|
zzzz
Libraries near you:
WorldCat
|
2 |
zzzz
Libraries near you:
WorldCat
|
3
Introduction to Algorithms and Java CD-ROM
December 16, 2003, McGraw-Hill Science/Engineering/Math
in English
0072970545 9780072970548
|
zzzz
Libraries near you:
WorldCat
|
4
Introduction to Algorithms, Second Edition
July 16, 2001, McGraw-Hill Science/Engineering/Math
Hardcover
in English
- 2 edition
0070131511 9780070131514
|
zzzz
Libraries near you:
WorldCat
|
5
Introduction to Algorithms, Second Edition
July 16, 2001, McGraw-Hill Science/Engineering/Math
in English
0070131511 9780070131514
|
zzzz
Libraries near you:
WorldCat
|
6 |
zzzz
Libraries near you:
WorldCat
|
7 |
aaaa
Libraries near you:
WorldCat
|
8 |
eeee
|
9 |
zzzz
Libraries near you:
WorldCat
|
Book Details
Table of Contents
Growth of functions
Summations
Recurrences
Sets, etc.
Counting and probability
Heapsort
Quicksort
Sorting in linear time
Medians and order statistics
Elementary data structures
Hash tables
Binary search trees
Red-black trees
Augmenting data structures
Dynamic programming
Greedy algorithms
Amortized analysis
B-trees
Binomial heaps
Fibonacci heaps
Data structures for disjoint sets
Elementary graph algorithms
Minimum spanning trees
Single-source shortest paths
All-pairs shortest paths
Maximum flow
Sorting networks
Arithmetic circuits
Algorithms for parallel computers
Matrix operations
Polynomials and the FFT
Number-theoretic algorithms
String matching
Computational geometry
NP-completeness
Approximation algorithms.
Edition Notes
Includes bibliographcal references (p. [987]-996) and index.
Classifications
The Physical Object
ID Numbers
Source records
Oregon Libraries MARC recordInternet Archive item record
Internet Archive item record
Internet Archive item record
OpenLibraries-Trent-MARCs record
Internet Archive item record
Internet Archive item record
amazon.com record
Library of Congress MARC record
Promise Item
Promise Item
Better World Books record
ISBNdb
Community Reviews (0)
Feedback?History
- Created October 16, 2008
- 18 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
December 19, 2023 | Edited by ImportBot | import existing book |
October 17, 2023 | Edited by ImportBot | import existing book |
January 14, 2023 | Edited by ImportBot | import existing book |
December 7, 2022 | Edited by ImportBot | import existing book |
October 16, 2008 | Created by ImportBot | Imported from Oregon Libraries MARC record |