Image from Google Jackets

Introduction to algorithms. / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest.

By: Contributor(s): Material type: TextSeries: The MIT electrical engineering and computer science seriesPublication details: Cambridge, Mass. : MIT Press ; New York : McGraw-Hill, c1990.Description: xvii, 1028 p. : ill. ; 26 cmISBN:
  • 0262031418
  • 0070131430 (McGrawHill)
Subject(s): DDC classification:
  • 005.1 20
LOC classification:
  • QA76.6.C662
Contents:
Contents: Introduction -- Mathematical foundations: Introduction: Growth of functions -- Summations -- Recurrences -- Sets, etc -- Counting and probability -- Sorting and order statistics: Introduction: Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- Data structures: Introduction: Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- Advanced design and analysis techniques: Introduction:Dynamic programming -- Greedy algorithm -- Amortized analysis -- Adavnced data structures: Introduction: B-trees -- Binomial heaps -- Fibonacci heaps -- Data structures for disjoints sets -- Graph algorithm: Introduction: Elementary graph algorithm -- Minimum spannin trees -- Single-source shortest paths -- Maximum flow -- Selected topics: Introduction: Sorting networks -- Arithmetic circuits -- Algorithms for parallel computers -- Matrix operations -- Polynomials and the EFT -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Cover image Item type Current library Home library Collection Shelving location Call number Materials specified Vol info URL Copy number Status Notes Date due Barcode Item holds Item hold queue priority Course reserves
Books WISCONSIN INTERNATIONAL UNIVERSITY COLLEGE, GHANA - MAIN LIBRARY Reference WISCONSIN INTERNATIONAL UNIVERSITY COLLEGE, GHANA - MAIN LIBRARY QA76.6.C662 (Browse shelf(Opens below)) Available 6230/12

Includes bibliographcal references (p. [987]-996) and index.

Contents: Introduction -- Mathematical foundations: Introduction: Growth of functions -- Summations -- Recurrences -- Sets, etc -- Counting and probability -- Sorting and order statistics: Introduction: Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- Data structures: Introduction: Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- Advanced design and analysis techniques: Introduction:Dynamic programming -- Greedy algorithm -- Amortized analysis -- Adavnced data structures: Introduction: B-trees -- Binomial heaps -- Fibonacci heaps -- Data structures for disjoints sets -- Graph algorithm: Introduction: Elementary graph algorithm -- Minimum spannin trees -- Single-source shortest paths -- Maximum flow -- Selected topics: Introduction: Sorting networks -- Arithmetic circuits -- Algorithms for parallel computers -- Matrix operations -- Polynomials and the EFT -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms.

There are no comments on this title.

to post a comment.
Share

If you have any concerns or questions; kindly contact the library

© Powered by WIUC ICT DIRECTORATE