Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest
Material type:
TextPublication details: New York : McGraw Hill Education, c1990Description: xvii, 1028 pages : illustrations ; 26 cmISBN: - 9780070131439
- QA 76.6 .C67 1990
Books
| Item type | Current library | Home library | Collection | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|---|
|
Books
|
National University - Manila | LRC - Main General Circulation | Gen. Ed. - CCIT | GC QA 76.6 .C67 1990 (Browse shelf(Opens below)) | c.1 | Available | NULIB000018963 |
Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Gen. Ed. - CCIT Close shelf browser (Hides shelf browser)
|
|
|
|
|
No cover image available | No cover image available | ||
| GC QA 76.5 .S54 2012 Discovering computers fundamentals : your interactive guide to the digital world / | GC QA 76.5 .W55 1995 Using information technology : a practical introduction to computers and communications / | GC QA 76.6 .C53 2021 Computer programming for beginners : fundamentals of programming terms and concepts / | GC QA 76.6 .C67 1990 Introduction to algorithms / | GC QA 76.7 .H65 1991 Advanced assembly language / | GC QA 76.8 .S54 1990 Novell NetWare 386 : the complete reference / | GC QA 76.8.I2594 .F47 1990 Programmer's guide to the EGA and VGA cards / |
Includes index.
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.
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.
There are no comments on this title.