Digital List Price:	CDN$ 39.99
Print List Price:	CDN$ 40.00
Kindle Price:	CDN$ 31.99 Save CDN$ 8.01 (20%)
	includes free international wireless delivery via *Amazon Whispernet*
Sold by:	Amazon.com.ca, Inc.

Algorithms Unlocked by [Thomas H. Cormen]

Follow the Author

Thomas H. Cormen

Algorithms Unlocked Kindle Edition

by Thomas H. Cormen (Author) Format: Kindle Edition

4.5 111 ratings

See all formats and editions

Amazon Price

New from

Used from

Kindle Edition

"Please retry"

$31.99

—

Hardcover, Import

"Please retry"

—

$91.05

$94.12

Paperback

"Please retry"

$47.61

$40.00

$16.88

Kindle Edition
$31.99 Read with Our Free App
Hardcover
from $91.05

1 Used from $94.12 2 New from $91.05
Paperback
$47.61

10 Used from $16.88 21 New from $40.00 1 Collectible from $109.29

For anyone who has ever wondered how computers solve problems, an engagingly written guide for nonexperts to the basics of computer algorithms.

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.

Print length

238 pages
Language

English
Sticky notes

On Kindle Scribe
Publisher

The MIT Press
Publication date

March 1 2013
File size

2745 KB
Page Flip

Enabled
Word Wise

Not Enabled
Enhanced typesetting

Enabled
See all details

Product description

Review

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

Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. He is the coauthor (with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein) of the leading textbook on computer algorithms, Introduction to Algorithms (third edition, MIT Press, 2009). --This text refers to the paperback edition.

Product details

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:
4.5 111 ratings

About the author

Follow authors to get new release updates, plus improved recommendations.

Thomas H. Cormen

Brief content visible, double tap to read full content.

Full content visible, double tap to read brief content.

Thomas H. Cormen is Emeritus Professor and former Chair of the Dartmouth College Department of Computer Science and former director of the Dartmouth College Institute for Writing and Rhetoric. He received the B.S.E. degree in Electrical Engineering and Computer Science from Princeton University in 1978 and the S.M. and Ph.D. degrees in Electrical Engineering and Computer Science from MIT in 1986 and 1993, respectively. He is coauthor of the leading textbook on computer algorithms, Introduction to Algorithms, which he wrote with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The book, now in its fourth edition, has been translated into several languages. He is also the author of Algorithms Unlocked, a gentle introduction to understanding computer algorithms and how they relate to real-world problems.

Outside computer science, Cormen likes skating (inline and nordic), paddling, and cooking and eating barbecue. He considers himself the world's worst electrician who has a Ph.D. in electrical engineering.

Aditya Bhargava
1,224
Kindle Edition
1 offer from $41.99

Customer reviews

4.5 out of 5

111 global ratings

5 star		76%
4 star		12%
3 star		5%
2 star		2%
1 star		4%

How are ratings calculated?

Top review from Canada

There was a problem filtering reviews right now. Please try again later.

John Smith

Difficult to read

Reviewed in Canada 🇨🇦 on February 9, 2021

Verified Purchase

After seeing all the positive reviews, I had high hopes for this book but didn't enjoy reading it at all. The chapters are dull and dry. Lots of paragraphs that are hard to read and make sense of. Few pictures and even those black and white pictures don't have numbers; so, sometimes it is hard to know which picture the author is talking about.
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.

Helpful

Top reviews from other countries

Translate all reviews to English

DavidB

this was a fantastic introduction to algorithms and helped scratch a theoretic itch

Reviewed in the United Kingdom 🇬🇧 on July 20, 2018

Verified Purchase

As a software engineer of a decade who never done computer science at uni and doesn't work with algorithms on a daily basis, this was a fantastic introduction to algorithms and helped scratch a theoretic itch.

One person found this helpful

Sachin Kumar

Best book to read before "introduction to algorithm" by clrs

Reviewed in the United Kingdom 🇬🇧 on September 21, 2018

Verified Purchase

Best book for novice

Olivier

Un excellent contenu et une posture agaçante

Reviewed in France 🇫🇷 on August 7, 2014

Verified Purchase

L'auteur de ce livre est évidemment le Cormen de Cormen, Leiserson, Rivest et Stein [CLRS], mais au lieu de 1300 pages cet ouvrage en fait 240. Il joue donc dans la catégorie des livres d'introduction à l'algorithmique et il est excellent dans ce rôle. Même introductif, cet ouvrage reste suffisamment précis, et la réduction de volume s'opère plus par une sélection des sujets que par une perte de finesse d'analyse. Il est comparable en cela à d'autres ouvrages introductifs comme ceux de Baase ou de Levitin, mais en diffère plus par les sujets sélectionnés que par le traitement de ces sujets. Je ne me prononcerai pas sur la pertinence des sujets sélectionnés par cet ouvrage et les autres qui jouent dans la même catégorie. Tous ont leur logique et il est très probable que chaque enseignant en algorithmique opèrera sa propre sélection. Je recommande donc la lecture de cet ouvrage sans réserve sur le fond.

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é » !

3 people found this helpful

Translate review to English

Divyanshu

Good book for anyone looking for a brief intro to ...

Reviewed in India 🇮🇳 on March 28, 2018

Verified Purchase

Good book for anyone looking for a brief intro to algos but not recommended . It is complete in it self but as im doing btech cs it's not what we need. Better one would be the CLRS .

3 people found this helpful

Jack Clapper

The book is definitely very good. It comprehensive and is a must to read ...

Reviewed in India 🇮🇳 on December 15, 2015

Verified Purchase

The book is definitely very good. It comprehensive and is a must to read before starting with any other books about algorithms.

Amazon Music Stream millions of songs	Amazon Advertising Find, attract and engage customers	Amazon Business Everything for your business	Amazon Drive Cloud storage from Amazon	Amazon Web Services Scalable Cloud Computing Services

Book Depository Books With Free Delivery Worldwide	Goodreads Book reviews & recommendations	IMDb Movies, TV & Celebrities	Amazon Photos Unlimited Photo Storage Free With Prime	Shopbop Designer Fashion Brands

Warehouse Deals Open-Box Discounts	Whole Foods Market We Believe in Real Food	Amazon Renewed Like-new products you can trust	Blink Smart Security for Every Home

Follow the Author

Algorithms Unlocked Kindle Edition

Product description

Review

About the Author

Review

Product details

About the author

Thomas H. Cormen

Customers who bought this item also bought

Customer reviews

Top review from Canada

There was a problem filtering reviews right now. Please try again later.

Top reviews from other countries