Introduction to algorithms / by Thomas H. Cormen..[et..al.].

By: Cormen, Thomas HContributor(s): Cormen, Thomas H | Leiserson, Charles E | Ronald L. Rivest | Stein, CliffordMaterial type: TextTextPublication details: New Delhi : PHI Learning Education Private Limited, 2013Edition: 3rd edDescription: vi, 1292 p. : ill. ; 26 cmISBN: 9788120340077(pbk)Subject(s): Computer algorithms | Computer ScienceDDC classification: 005.1
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.
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
Item type Current library Call number Copy number Status Date due Barcode Item holds
Book Bank Namal Library
Book Bank 		005.1 COR-I 2013 5178 (Browse shelf (Opens below)) Checked out 07/15/2024 0005178
Book Bank Namal Library
Book Bank 		005.1 COR-I 2013 5179 (Browse shelf (Opens below)) c.2 Available 0005179
Book Bank Namal Library
Book Bank 		005.1 COR-I 2013 5180 (Browse shelf (Opens below)) c.3 Available 0005180
Book Bank Namal Library
Book Bank 		005.1 COR-I 2013 5181 (Browse shelf (Opens below)) c.4 Available 0005181
Book Bank Namal Library
Book Bank 		005.1 COR-I 2013 5182 (Browse shelf (Opens below)) c.5 Available 0005182
Book Bank Namal Library
Book Bank 		005.1 COR-I 2013 5183 (Browse shelf (Opens below)) c.6 Available 0005183
Book Bank Namal Library
Book Bank 		005.1 COR-I 2013 5184 (Browse shelf (Opens below)) c.7 Available 0005184
Book Bank Namal Library
Book Bank 		005.1 COR-I 2013 5185 (Browse shelf (Opens below)) c.8 Available 0005185
Book Bank Namal Library
Book Bank 		005.1 COR-I 2013 5186 (Browse shelf (Opens below)) c.9 Available 0005186
Book Bank Namal Library
Book Bank 		005.1 COR-I 2013 5187 (Browse shelf (Opens below)) c.10 Checked out 07/22/2024 0005187
Book Bank Namal Library
Book Bank 		005.1 COR-I 2013 5188 (Browse shelf (Opens below)) c.11 Available 0005188
Total holds: 0

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.

There are no comments on this title.

to post a comment.