机读格式显示(MARC)
- 000 02061nam 2200373 a 4500
- 008 890803s2001 maua b 001 0 eng
- 020 __ |a 0262531968 : |c CNY300.00
- 020 __ |a 0070131511 (McGraw-Hill)
- 040 __ |a DLC |c DLC |d PSM
- 050 00 |a QA76.6 |b .C662 1990
- 090 __ |a TP301.6/IA:2/(2)
- 099 __ |a CAL 022002080145
- 245 00 |a Introduction to algorithms / |c Thomas H. Cormen ... [et al.].
- 260 __ |a Cambridge, MA : |b MIT Press ; |a New York : |b McGraw-Hill, |c c2001.
- 300 __ |a xxi, 1180 p. : |b ill. ; |c 24 cm.
- 440 _4 |a The MIT electrical engineering and computer science series
- 504 __ |a Includes bibliographical references (p. [1127]-1143) and index.
- 505 0_ |a 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.
- 650 _0 |a Computer programming.
- 650 _0 |a Computer algorithms.
- 700 1_ |a Cormen, Thomas H.
- 905 __ |a CAU |f TP301.6/IA:2/(2) |b W0074214(or.)
- 907 __ |a CAU |f TP301.6/IA:2/(2) |b W0074214(or.)
- 999 __ |t C |A xy1 |a 20050909 16:32:41 |I wzhlc |i 20050928 09:18:51 |G wzhlc |g 20050928 09:20:2