|Digital List Price:||CDN$ 39.99|
|Print List Price:||CDN$ 40.00|
|Kindle Price:|| CDN$ 31.99 |
Save CDN$ 8.01 (20%)
|Sold by:||Amazon.com.ca, Inc.|
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet or computer – no Kindle device required. Learn more
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera, scan the code below and download the Kindle app.
Follow the Author
Algorithms Unlocked Kindle Edition
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.
Algorithms are at the center of computer science. This is a unique book in its attempt to open the field of algorithms to a wider audience. It provides an easy-to-read introduction to an abstract topic, without sacrificing depth. This is an important contribution and there is nobody more qualified than Thomas Cormen to bridge the knowledge gap between algorithms experts and the general public.―Frank Dehne, Chancellor's Professor of Computer Science, Carleton University
Thomas Cormen has written an engaging and readable survey of basic algorithms. The enterprising reader with some exposure to elementary computer programming will discover insights into the key algorithmic techniques that underlie efficient computation.―Phil Klein, Professor, Department of Computer Science, Brown University
Thomas Cormen helps readers to achieve a broad understanding of the key algorithms underlying much of computer science. For computer science students and practitioners, it is a great review of key algorithms that every computer scientist must understand. For non-practitioners, it truly unlocks the world of algorithms at the heart of the tools we use every day.―G. Ayorkor Korsah, Computer Science Department, Ashesi University College --This text refers to the paperback edition.
About the Author
- ASIN : B08BT4MBJN
- Publisher : The MIT Press (March 1 2013)
- Language : English
- File size : 2745 KB
- Text-to-Speech : Enabled
- Screen Reader : Supported
- Enhanced typesetting : Enabled
- X-Ray : Not Enabled
- Word Wise : Not Enabled
- Sticky notes : On Kindle Scribe
- Print length : 238 pages
- Page numbers source ISBN : 0262518805
- Best Sellers Rank: #1,169,472 in Kindle Store (See Top 100 in Kindle Store)
- #2,573 in Computer Algorithms
- #1,169,472 in Kindle eBooks
- Customer Reviews:
About the author
Top review from Canada
There was a problem filtering reviews right now. Please try again later.
The code examples are not great either. The indexes of arrays start at 1 to make it easier to understand for non-programmers but makes it harder for programmers, and yet it is highly mathematical and abstract even for me as a programmer. I find it hard to believe a non-programmer can read this book and make sense of most of it.
Top reviews from other countries
Pourquoi les étoiles en moins alors ? Malheureusement l'auteur s'est enfermé dans la posture énervante de rédiger un teaser pour CLRS. Il est normal de renvoyer à CLRS pour les sujets non traités, mais il arrive trop souvent, à chaque chapitre en fait, que l'auteur renvoie à CLRS pour les sujets traités, et pas pour des raffinements qui n'auraient pas leur place dans une introduction, mais pour des éléments qui y ont toute leur place comme la bibliographie ou l'histoire des algorithmes décrits. Introduire un lecteur à l'algorithmique c'est aussi guider ses premiers pas dans la bibliographie et lui expliquer un petit peu comment se sont développées les idées dans ce domaine ; ça ne peut pas se réduire à « allez-voir le livre sacré » !