01512cam a22003378i 450000100090000000300040000900500170001300800410003001000170007102000250008803500130011304000240012608200210015010000330017124500540020425000090025826000840026726300090035130000200036033600260038033700280040633800270043436500170046150400510047852003360052965000360086565000460090165000360094765000420098377601490102523099548OSt20260425114930.0230501s2023    nyu      b    001 0 eng    a  2023011130  a9781009302135 (pbk.)  a23099548  aDLCbengerdacJKRC00223a518.1bEDM.J1 aEdmonds, Jeffd1963-eauthor10aHow to think about algorithms /cby Jeff Edmonds.  a2nd.  aCambridge, United Kingdom ;aNew York, NY :bCambridge University Press,c2024.  a2308  axv, 599c24 cm.  atextbtxt2rdacontent  aunmediatedbn2rdamedia  avolumebnc2rdacarrier  b29.99cPound  aIncludes bibliographical references and index.  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. 0aAlgorithmsxStudy and teaching. 0aLoops (Group theory)xStudy and teaching. 0aInvariantsxStudy and teaching. 0aRecursion theoryxStudy and teaching.08iOnline version:aEDMONDS, JEFF.tHow to think about algorithmsb2.dNew York : Cambridge University Press, 2023z9781009302180w(DLC) 2023011131