000 02519cam a2200349 a 4500
001 u5327
003 SA-PMU
005 20210418124031.0
008 090226s2009 maua b 001 0 eng
010 _a 2009008593
040 _aDLC
_beng
_cDLC
_dBTCTA
_dYDXCP
_dUKM
_dC#P
_dBWX
_dCDX
_dNLGGC
_dCUV
_dHEBIS
_dDEBBG
_dOCL
_dIXA
_dMNW
_dMIX
_dTVG
020 _a9780262033848 (hardcover : alk. paper)
020 _a0262033844 (hardcover : alk. paper)
020 _a9780262533058 (pbk. : alk. paper)
020 _a0262533057 (pbk. : alk. paper)
035 _a(OCoLC)311310321
050 0 0 _aQA76.6
_b.C662 2009
082 0 0 _a005.1
_222
245 0 0 _aIntroduction to algorithms /
_cThomas H. Cormen ... [et al.].
250 _a3rd ed.
260 _aCambridge, Mass. :
_bMIT Press,
_cc2009.
300 _axix, 1292 p. :
_bill. ;
_c24 cm.
504 _aIncludes bibliographical references (p. [1231]-1250) and index.
520 _aThis edition has been revised and updated throughout. It includes some new chapters. It features improved treatment of dynamic programming and greedy algorithms as well as a new notion of edge-based flow in the material on flow networks.--[book cover]
505 0 _aI. 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.
650 0 _aComputer programming.
650 0 _aComputer algorithms.
700 1 _aCormen, Thomas H.
942 _cBOOK
994 _aZ0
_bSUPMU
596 _a1 2
999 _c5873
_d5873