---
product_id: 9621143
title: "Algorithms Unlocked (Mit Press)"
price: "NT$1927"
currency: TWD
in_stock: true
reviews_count: 8
url: https://www.desertcart.tw/products/9621143-algorithms-unlocked-mit-press
store_origin: TW
region: Taiwan
---

# Algorithms Unlocked (Mit Press)

**Price:** NT$1927
**Availability:** ✅ In Stock

## Quick Answers

- **What is this?** Algorithms Unlocked (Mit Press)
- **How much does it cost?** NT$1927 with free shipping
- **Is it available?** Yes, in stock and ready to ship
- **Where can I buy it?** [www.desertcart.tw](https://www.desertcart.tw/products/9621143-algorithms-unlocked-mit-press)

## Best For

- Customers looking for quality international products

## Why This Product

- Free international shipping included
- Worldwide delivery with tracking
- 15-day hassle-free returns

## Description

Algorithms Unlocked (Mit Press): 9780262518802: Computer Science Books @ desertcart.com

Review: Best overall "motivated learner" book on Algorithms - I am reading lot of algorithms books lately due to rekindled interest (the last time I am this motivated is during my high school days!) and the common advice is to read CLRS (C for Cormen) but the book is a 500 pound gorilla and it is neck deep in detailed Math. Imagine my delight when I stumbled on "Algorithms Unlocked" by Cormen - I call this book Baby Cormen. My background is in software engineering and I am paying my dues for 10+ years. I like math but am not in touch with it for many years; though I am currently taking steps to remedy it. So that’s the context. Here goes my review: Pros 1. It has a section on "Algorithms on Strings". Out of many books that I perused (Algorithms in a nutshell, Skiena, Eva Tardos etc.), this book, CLRS, Algorithms by Sedgwick has a section on Strings. There are dedicated books on String algorithms but "string problems" appear practically in almost every software engineer's career that I think any general algorithms book should cover a basic portion of it. This one does. 2. Chatty but neither boring nor tedious. It uses enough words to convey the concept efficiently. 3. It contains math for sections on complexity but algorithm concepts are supported with pictures, sample algorithm runs. One just needs to follow logical arguments as it is explained. 4. All the chapters except last few pages in chapter 9, 10 are gems. 5. The length of the book is ~222. This cannot be overstated. The faster u reach towards the end of the book the better you will feel about yourself and the more you will like to finish it. 6. Pretty good paper quality and print. Love this about MIT press. 7. Price is cheap. 8. No exercises. Yes this is a good thing actually. It would have affected the flow of the book. If you need exercises then go to Big Cormen (CLRS). Cons 1. Typos/Errors. 14 when I counted. I actually thought it cannot have any because some reviewer here said it was copyedited by someone who is a stickler for perfection so I didn't bother to check the errata page (my bad but only 14 errata’s is still impressive) until I stumbled on a possible typo (it turns out it is not) and tried to contact the author by going to the book's website. One should make sure to correct it in the book before reading. 2. Chapter 9 - section on LZW compression/decompression could have been little clearer. Chapter 10 - section on Hamiltonian cycle to Hamiltonian path reduction, subset sum reduction could have been little clearer because the explanation had more gaps in logic than usual. The author did say in the preface that he couldn't control getting into more details near the very end of the book but I felt the explanation was unclear because it is rushed than more technical details are employed. All in all this is a solid book that treats you as an intelligent human being than a space alien or a brick.
Review: An excellent introduction to algorithms - This is an interesting book. It's halfway between the typical science-book-for-non-scientists and a textbook. Unlike most science books for non-scientists, the author doesn't dumb down the material for the reader; he assumes you're intelligent and are willing to work a bit to understand what he says (including following mathematical arguments with actual equations). In fact, I only bought the book because the author was Cormen; I was familiar with his algorithms textbook (Introduction to Algorithms, better known as CLRS after the initials of the authors), which is absolutely authoritative, so I knew the material would be correct. (Having Julie Sussman, P.P.A., as the proofreader was also a big plus.) Unlike CLRS, this is not a textbook, but rather kind of a "pre-textbook". Its purpose is to whet your appetite, to teach you enough about the material so that you can decide if you want to study it more formally or not. If so, you can go straight to CLRS. If not, at least you'll have learned something. The people who will get the most out of this book are self-taught programmers who have never taken a course in algorithms but who nevertheless need to know this material. (And believe me, if you're a programmer, you _do_ need to know this material, whether you realize it or not.) Non-programmers may find that the book is too technical (especially the last few chapters, which get fairly heavily into topics like number theory and reductions of NP-complete problems). Despite this, I can think of no other book that provides such a clear introduction to the field of algorithms with so few prerequisites. Cormen's explanations are lucid and interesting throughout, and the topics are motivated by real-world applications which often don't find their way into textbook descriptions. Algorithms are described using a kind of pseudocode which is similar to that found in CLRS, but with a lot more written exposition. Overall, this is a great book if you're interested in the topic, or think you might be. Personally, I greatly prefer this kind of "pre-textbook" approach to the usual popular science book approach, and I hope that the example this book sets encourages more textbook writers to write such books.

## Technical Specifications

| Specification | Value |
|---------------|-------|
| Best Sellers Rank | #1,329,588 in Books ( See Top 100 in Books ) #110 in Computer Algorithms #306 in Programming Algorithms |
| Customer Reviews | 4.4 out of 5 stars 125 Reviews |

## Images

![Algorithms Unlocked (Mit Press) - Image 1](https://m.media-amazon.com/images/I/71ZtvVQbjqL.jpg)

## Customer Reviews

### ⭐⭐⭐⭐⭐ Best overall "motivated learner" book on Algorithms
*by A***N on February 16, 2017*

I am reading lot of algorithms books lately due to rekindled interest (the last time I am this motivated is during my high school days!) and the common advice is to read CLRS (C for Cormen) but the book is a 500 pound gorilla and it is neck deep in detailed Math. Imagine my delight when I stumbled on "Algorithms Unlocked" by Cormen - I call this book Baby Cormen. My background is in software engineering and I am paying my dues for 10+ years. I like math but am not in touch with it for many years; though I am currently taking steps to remedy it. So that’s the context. Here goes my review: Pros 1. It has a section on "Algorithms on Strings". Out of many books that I perused (Algorithms in a nutshell, Skiena, Eva Tardos etc.), this book, CLRS, Algorithms by Sedgwick has a section on Strings. There are dedicated books on String algorithms but "string problems" appear practically in almost every software engineer's career that I think any general algorithms book should cover a basic portion of it. This one does. 2. Chatty but neither boring nor tedious. It uses enough words to convey the concept efficiently. 3. It contains math for sections on complexity but algorithm concepts are supported with pictures, sample algorithm runs. One just needs to follow logical arguments as it is explained. 4. All the chapters except last few pages in chapter 9, 10 are gems. 5. The length of the book is ~222. This cannot be overstated. The faster u reach towards the end of the book the better you will feel about yourself and the more you will like to finish it. 6. Pretty good paper quality and print. Love this about MIT press. 7. Price is cheap. 8. No exercises. Yes this is a good thing actually. It would have affected the flow of the book. If you need exercises then go to Big Cormen (CLRS). Cons 1. Typos/Errors. 14 when I counted. I actually thought it cannot have any because some reviewer here said it was copyedited by someone who is a stickler for perfection so I didn't bother to check the errata page (my bad but only 14 errata’s is still impressive) until I stumbled on a possible typo (it turns out it is not) and tried to contact the author by going to the book's website. One should make sure to correct it in the book before reading. 2. Chapter 9 - section on LZW compression/decompression could have been little clearer. Chapter 10 - section on Hamiltonian cycle to Hamiltonian path reduction, subset sum reduction could have been little clearer because the explanation had more gaps in logic than usual. The author did say in the preface that he couldn't control getting into more details near the very end of the book but I felt the explanation was unclear because it is rushed than more technical details are employed. All in all this is a solid book that treats you as an intelligent human being than a space alien or a brick.

### ⭐⭐⭐⭐⭐ An excellent introduction to algorithms
*by M***R on April 23, 2013*

This is an interesting book. It's halfway between the typical science-book-for-non-scientists and a textbook. Unlike most science books for non-scientists, the author doesn't dumb down the material for the reader; he assumes you're intelligent and are willing to work a bit to understand what he says (including following mathematical arguments with actual equations). In fact, I only bought the book because the author was Cormen; I was familiar with his algorithms textbook (Introduction to Algorithms, better known as CLRS after the initials of the authors), which is absolutely authoritative, so I knew the material would be correct. (Having Julie Sussman, P.P.A., as the proofreader was also a big plus.) Unlike CLRS, this is not a textbook, but rather kind of a "pre-textbook". Its purpose is to whet your appetite, to teach you enough about the material so that you can decide if you want to study it more formally or not. If so, you can go straight to CLRS. If not, at least you'll have learned something. The people who will get the most out of this book are self-taught programmers who have never taken a course in algorithms but who nevertheless need to know this material. (And believe me, if you're a programmer, you _do_ need to know this material, whether you realize it or not.) Non-programmers may find that the book is too technical (especially the last few chapters, which get fairly heavily into topics like number theory and reductions of NP-complete problems). Despite this, I can think of no other book that provides such a clear introduction to the field of algorithms with so few prerequisites. Cormen's explanations are lucid and interesting throughout, and the topics are motivated by real-world applications which often don't find their way into textbook descriptions. Algorithms are described using a kind of pseudocode which is similar to that found in CLRS, but with a lot more written exposition. Overall, this is a great book if you're interested in the topic, or think you might be. Personally, I greatly prefer this kind of "pre-textbook" approach to the usual popular science book approach, and I hope that the example this book sets encourages more textbook writers to write such books.

### ⭐⭐⭐⭐⭐ Thanks For This Book
*by J***N on March 11, 2013*

Upon un-boxing, I looked at the back cover photo and thought, "uh-oh, another Ivy League professor who thinks everything is intuitively obvious, and disrespects you if it's not." One of the reasons more Americans don't go into computer science IMHO is that the basics are NOT intuitive, and turning your class into a boot camp - with programming assignments made purposely too time consuming - does nothing but hinder....oh, wait, this is a book review, I digress. Anyways, this book is NOT that, it's a good book. For example, chapter 2 goes from assuming no knowledge of computer programming to asymptotic notation, and it's actually understandable! I've taken an algorithms class, and although able to muddle through it, I only understood about 1/4 the theoretical part. This book helps fill that void and I have renewed confidence that I will be able to understand the more theoretical aspect to algorithms the next time I encounter them (I'm back in school studying CS at night). I've read this book once, from cover to cover - retaining about 1/2 of it. Now it's a second time with highlighter and notes so that I can retain the book in its entirety. It's not really a book for the "we're all going to be cyborgs, algorithms rule the world" pop-computing crowd, and I suspect it would take a gifted reader to understand this book if he or she truly had no clue about programming. A computer program algorithm is a different way of looking at the world than most folks are used to. But in the first chapter - presumably the one somebody would thumb through at the book store - the author actually points the reader to a less technical book if this one seems too technical. This book would be an awesome supplemental text for a class involving logic, critical thinking, scientific thinking, mathematical thinking, or an undergraduate computer science course on algorithms. The only thing I thought missing were some exercises so I could test that I truly mastered the chapter. Would be cool if there was a website related to the book that had worked out examples to replicate the text so I'd have to actively duplicate what the book explains.

---

## Why Shop on Desertcart?

- 🛒 **Trusted by 1.3+ Million Shoppers** — Serving international shoppers since 2016
- 🌍 **Shop Globally** — Access 737+ million products across 21 categories
- 💰 **No Hidden Fees** — All customs, duties, and taxes included in the price
- 🔄 **15-Day Free Returns** — Hassle-free returns (30 days for PRO members)
- 🔒 **Secure Payments** — Trusted payment options with buyer protection
- ⭐ **TrustPilot Rated 4.5/5** — Based on 8,000+ happy customer reviews

**Shop now:** [https://www.desertcart.tw/products/9621143-algorithms-unlocked-mit-press](https://www.desertcart.tw/products/9621143-algorithms-unlocked-mit-press)

---

*Product available on Desertcart Taiwan*
*Store origin: TW*
*Last updated: 2026-05-17*