000			01737cam a22003858i 4500
001			23099548
003			OSt
005			20260425114930.0
008			230501s2023 nyu b 001 0 eng
010			_a 2023011130
020			_a9781009302135 (pbk.)
035			_a23099548
040			_aDLC _beng _erda _cJKRC
082	0	0	_223 _a518.1 _bEDM.J
100	1		_aEdmonds, Jeff _d1963- _eauthor _939473
245	1	0	_aHow to think about algorithms / _cby Jeff Edmonds.
250			_a2nd.
260			_aCambridge, United Kingdom ; _aNew York, NY : _bCambridge University Press, _c2024.
263			_a2308
300			_axv, 599 _c24 cm.
336			_atext _btxt _2rdacontent
337			_aunmediated _bn _2rdamedia
338			_avolume _bnc _2rdacarrier
365			_b29.99 _cPound
504			_aIncludes bibliographical references and index.
520			_a"The second edition of this student-friendly textbook now includes over 150 new exercises, key concept summaries and a chapter on machine learning algorithms. Its approachability and clarity make it ideal as both a main course text or as a supplementary book for students who find other books challenging"-- _cProvided by publisher.
650		0	_aAlgorithms _xStudy and teaching. _939474
650		0	_aLoops (Group theory) _xStudy and teaching. _939475
650		0	_aInvariants _xStudy and teaching. _939476
650		0	_aRecursion theory _xStudy and teaching. _939477
776	0	8	_iOnline version: _aEDMONDS, JEFF. _tHow to think about algorithms _b2. _dNew York : Cambridge University Press, 2023 _z9781009302180 _w(DLC) 2023011131
906			_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg
942			_2ddc _c1 _e23 _n0
999			_c613866 _d613866