Introduction to algorithms [electronic resource] / Thomas H. Cormen [and others].
Material type: TextPublication details: Cambridge, Mass. : MIT Press, �2009.Edition: 3rd edDescription: 1 online resource (xix, 1292 pages) : illustrationsContent type:- text
- computer
- online resource
- 9780262270830
- 0262270838
- 9781628709131
- 1628709138
- Computer programming
- Computer algorithms
- Computer algorithms
- Computer programming
- COMPUTERS -- Programming -- Open Source
- COMPUTERS -- Software Development & Engineering -- Tools
- COMPUTERS -- Software Development & Engineering -- General
- Computer algorithms
- Computer programming
- Algoritmen
- Algorithmentheorie
- Algorithmische Programmierung
- Algorithmische Programmierung
- Algorithmentheorie
- 005.1 22
- QA76.6 .C662 2009eb
Item type | Current library | Shelving location | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|---|
Electronic Book | Kuakarun Nursing Library | Processing unit | Online Access | eb36012 |
Includes bibliographical references and index.
I. Foundations. The role of algorithms in computing -- Getting started -- Growth of functions -- Divide-and-conquer -- Probabilistic analysis and randomized algorithms -- II. Sorting and order statistics. Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- III. Data structures. Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- IV. Advanced design and analysis techniques. Dynamic programming -- Greedy algorithms -- Amortized analysis -- V. Advanced data structures. B-trees -- Fibonacci heaps -- van Emde Boas trees -- Data structures for disjoint sets -- VI. Graph algorithms. Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximun flow -- VII. Selected topics. Multithreaded algorithms -- Matrix operations -- Linear programming -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms -- VIII. Appendix: Mathematical background. Summations -- Sets, etc. -- Counting and probability -- Matrices.
Print version record.
There are no comments on this title.