000			01442cam a2200313 i 4500
005			20230110151054.0
008			140128s2013 maum b a001 0 eng
010			_a2012-036810
020			_a0262518805 (pbk. : alk. paper)
020			_a9780262518802 (pbk. : alk. paper)
035			_a(OCoLC)813540952
040			_aDLC _beng _erda _cDLC _dYDX _dYDXCP _dBTCTA _dOCLCO _dBWX _dCDX _dSOI _dUKMGB _dOCLCQ _dKSU _dUtOrBLW
042			_apcc
050	0	0	_aQA76.9.A43 _bC685 2013
082	0	0	_a005.1 _223
100	1		_aCormen, Thomas H.
245	1	0	_aAlgorithms unlocked / _cThomas H. Cormen.
264		1	_aCambridge, Massachusetts : _bThe MIT Press, _c[2013]
300			_axiii, 222 pages : _billustrations ; _c23 cm.
336			_atext _btxt _2rdacontent.
337			_aunmediated _bn _2rdamedia.
338			_avolume _bnc _2rdacarrier.
504			_aIncludes bibliographical references (pages 213-214) and index.
505	0		_aWhat are algorithms and why should you care? -- How to describe and evaluate computer algorithms -- Algorithms for sorting and searching -- A lower bound for sorting and how to beat it -- Directed acyclic graphs -- Shortest paths -- Algorithms on strings -- Foundations of cryptography -- Data compression -- Hard? Problems.
650		0	_aComputer algorithms.
942			_2lcc
999			_c67596 _d67596