Algorithms unlocked
Cormen, Thomas H
Algorithms unlocked - Cambridge, Massachusetts : The MIT Press, 2013. - 222 pages : 23 cm.
Preface -- 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 -- Bibliography -- Index.
9780262518802
Computer algorithms
005.1
Algorithms unlocked - Cambridge, Massachusetts : The MIT Press, 2013. - 222 pages : 23 cm.
Preface -- 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 -- Bibliography -- Index.
9780262518802
Computer algorithms
005.1