Algorithms Unlocked

Front Cover
MIT Press, 2013 - Computers - 222 pages
0 Reviews

Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? 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 simple 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; 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.

 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

1 What Are Algorithms and Why Should You Care?
1
2 How to Describe and Evaluate Computer Algorithms
10
3 Algorithms for Sorting and Searching
25
4 A Lower Bound for Sorting and How to Beat It
60
5 Directed Acyclic Graphs
71
6 Shortest Paths
90
7 Algorithms on Strings
115
8 Foundations of Cryptography
138
9 Data Compression
158
10 Hard? Problems
179
Bibliography
213
Index
215
Copyright

Other editions - View all

Common terms and phrases

About the author (2013)

Thomas H. Cormen received a Ph. D. from MIT in 1992. He is an associate professor at Dartmouth College. Cormen is one of the authors of Introduction to Algorithms.

Bibliographic information