| Description |
1 online resource (xiii, 222 pages) : illustrations |
| Bibliography |
Includes bibliographical references and index. |
| Note |
Print version record. |
| Contents |
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. |
| Summary |
"This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen- coauthor of the leading college textbook on the subject- provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems. Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simples ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order ("sorting"); how to solve basic problems that can be modeled in a computer with a mathematical structure called a "graph" (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; the fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time." -- Back cover. |
| Subject |
Computer algorithms.
|
|
COMPUTERS -- Programming -- Open Source.
|
|
COMPUTERS -- Software Development & Engineering -- General.
|
|
COMPUTERS -- Software Development & Engineering -- Tools.
|
|
Computer algorithms. (OCoLC)fst00872010
|
| Other Form: |
Print version: Cormen, Thomas H. Algorithms Unlocked. Cambridge, Massachusetts : The MIT Press, [2013] 9780262518802 (DLC) 2012036810 (OCoLC)813540952 |
| ISBN |
9780262313223 (electronic bk.) |
|
0262313227 (electronic bk.) |
|
9780262313230 (electronic bk.) |
|
0262313235 (electronic bk.) |
|
