Algorithms unlocked /
Cormen, Thomas H.
Algorithms unlocked / Thomas H. Cormen. - xiii, 222 pages : illustrations ; 23 cm.
Includes bibliographical references (pages 213-214) and index.
What 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.
0262518805 (pbk. : alk. paper) 9780262518802 (pbk. : alk. paper)
2012-036810
Computer algorithms.
QA76.9.A43 / C685 2013
005.1
Algorithms unlocked / Thomas H. Cormen. - xiii, 222 pages : illustrations ; 23 cm.
Includes bibliographical references (pages 213-214) and index.
What 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.
0262518805 (pbk. : alk. paper) 9780262518802 (pbk. : alk. paper)
2012-036810
Computer algorithms.
QA76.9.A43 / C685 2013
005.1