000 | 01167nam a22003018a 4500 | ||
---|---|---|---|
001 | 687268 | ||
005 | 20230419120940.0 | ||
008 | 090730s2009 mau f 001 0 eng|d | ||
020 |
_a9780262533058 (pbk.) : _c£39.95 |
||
020 |
_a0262533057 (pbk.) : _c£39.95 |
||
020 |
_a9780262033848 (hbk.) : _c£64.95 |
||
020 |
_a0262033844 (hbk.) : _c£64.95 |
||
035 | _a()0262533057 | ||
040 |
_aStDuBDS _cStDuBDS |
||
082 | 0 | 4 |
_a005.1 _222 |
245 | 0 | 0 |
_aIntroduction to algorithms / _cThomas H. Cormen ... [et al.]. |
250 | _a3rd edition. | ||
260 |
_aCambridge, Mass. ; _aLondon : _bMIT Press, _c2009. |
||
300 |
_a1216 p. ; _c23 cm. |
||
500 | _aPrevious ed.: 2001. | ||
504 | _aIncludes bibliographical references and index. | ||
520 | 8 | _aThis text covers a broad range of algorithms in depth. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. | |
521 | _aSpecialized. | ||
650 | 0 | _aComputer programming. | |
650 | 0 | _aComputer algorithms. | |
700 | 1 | _aCormen, Thomas H. | |
942 | _n0 | ||
999 |
_c42084 _d42084 |