000 03949cam a2200673Ia 4500
001 ocn676697295
003 OCoLC
005 20220525094047.0
006 m d
007 cr |||||||||||
008 101101s2009 maua ob 001 0 eng d
020 _a9780262270830
_q(electronic bk.)
020 _a0262270838
_q(electronic bk.)
020 _a9781628709131
_q(electronic bk.)
020 _a1628709138
_q(electronic bk.)
020 _z9780262033848
_q(hardcover ;
_qalk. paper)
020 _z0262033844
_q(hardcover ;
_qalk. paper)
020 _z9780262533058
_q(pbk. ;
_qalk. paper)
020 _z0262533057
_q(pbk. ;
_qalk. paper)
035 _a(OCoLC)676697295
_z(OCoLC)824745225
_z(OCoLC)889201944
_z(OCoLC)923252332
037 _a5A44A5DB-D913-40FF-B59F-2EBD4D1CBD32
_bOverDrive, Inc.
_nhttp://www.overdrive.com
040 _aN$T
_beng
_epn
_cN$T
_dYDXCP
_dOCLCQ
_dOSU
_dE7B
_dOCLCQ
_dIUL
_dOCLCQ
_dDEBSZ
_dOCLCQ
_dB24X7
_dTEFOD
_dOCLCF
_dCHVBK
_dZCU
_dKNOVL
_dOTZ
_dSFB
_dTEFOD
_dOCLCQ
_dEBLCP
_dOCLCQ
049 _aMAIN
050 4 _aQA76.6
_b.C662 2009eb
072 7 _aCOM
_x051390
_2bisacsh
072 7 _aCOM
_x051440
_2bisacsh
072 7 _aCOM
_x051230
_2bisacsh
082 0 4 _a005.1
_222
245 0 0 _aIntroduction to algorithms
_h[electronic resource] /
_cThomas H. Cormen [and others].
250 _a3rd ed.
260 _aCambridge, Mass. :
_bMIT Press,
_c�2009.
300 _a1 online resource (xix, 1292 pages) :
_billustrations
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
504 _aIncludes bibliographical references and index.
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.
588 0 _aPrint version record.
650 0 _aComputer programming.
650 0 _aComputer algorithms.
650 4 _aComputer algorithms.
650 4 _aComputer programming.
650 7 _aCOMPUTERS
_xProgramming
_xOpen Source.
_2bisacsh
650 7 _aCOMPUTERS
_xSoftware Development & Engineering
_xTools.
_2bisacsh
650 7 _aCOMPUTERS
_xSoftware Development & Engineering
_xGeneral.
_2bisacsh
650 7 _aComputer algorithms.
_2fast
_0(OCoLC)fst00872010
650 7 _aComputer programming.
_2fast
_0(OCoLC)fst00872390
650 1 7 _aAlgoritmen.
_2gtt
650 7 _aAlgorithmentheorie.
_2gnd
650 7 _aAlgorithmische Programmierung.
_2gnd
650 0 7 _aAlgorithmische Programmierung.
_2swd
650 0 7 _aAlgorithmentheorie.
_2swd
655 4 _aElectronic books.
700 1 _aCormen, Thomas H.
776 0 8 _iPrint version:
_tIntroduction to algorithms.
_b3rd ed.
_dCambridge, Mass. : MIT Press, �2009
_z9780262033848
_w(DLC) 2009008593
_w(OCoLC)311310321
850 _aVJRL-AP
856 4 0 _3EBSCOhost
_uhttps://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=343613
942 _2nlm
_cEBK
999 _c36012
_d36012