Goodreads helps you keep track of books you want to read.
Start by marking “Algorithms Demystified” as Want to Read:
Algorithms Demystified
Enlarge cover
Rate this book
Clear rating
Open Preview

Algorithms Demystified

4.16  ·  Rating Details ·  186 Ratings  ·  18 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 you ...more
Paperback, 240 pages
Published March 15th 2013 by MIT Press (MA) (first published 2013)
More Details... edit details

Friend Reviews

To see what your friends thought of this book, please sign up.

Reader Q&A

To ask other readers questions about Algorithms Demystified, please sign up.

Be the first to ask a question about Algorithms Demystified

This book is not yet featured on Listopia. Add this book to your favorite list »

Community Reviews

(showing 1-30)
filter  |  sort: default (?)  |  Rating Details
Jacek Ambroziak
Oct 16, 2016 Jacek Ambroziak rated it it was amazing  ·  review of another edition
This book is a gem. Extremely well written, not dry, yet precise. It covers many important algorithms and intuitions behind their design and timings. At a little over 200 pages, 10 chapters, the book can realistically be read in about 10 days in its entirety.
I am reading the book as part of preparation for a technical interview. It is wonderful in this context. I've been familiar with 99% of the algorithmic concepts this book discusses for years, and yet details not used daily are eventually fo
...more
Siddhant Shrivastava
Nov 03, 2016 Siddhant Shrivastava rated it it was amazing  ·  review of another edition
Shelves: cs
This is the kind of book one wants to keep coming back to. It is a crisp account of the different algorithms that run the world. A very easy read. The visceral treatment makes this book an introductory text. I highly recommend this to anyone interested in knowing about algorithms.
Manju
May 31, 2014 Manju rated it really liked it  ·  review of another edition
This book serves as a soft introduction to algorithms and how they work to solve real world problems,without any of the mathematical rigor. In that sense this book is quite useful to someone who is new to programming or simply wants to understand how computer programs or algorithms work. This is not a textbook (the other book ie. introduction to algorithms, coauthored by Cormen is more appropriate) that describes algorithm design techniques and certainly does not contain practice exercises at th ...more
Sudha Hariharan
Definitely not as good and thorough as "Introduction to Algorithms", but good enough for anyone looking a simpler introduction.
Frank Palardy
Feb 24, 2017 Frank Palardy rated it really liked it  ·  review of another edition
Shelves: algorithms-tech
His other book has so much math you forget the algorithms. His one tries to avoid that but its still very detailed. More math than coding.
Mkfs
Aug 06, 2013 Mkfs rated it it was amazing  ·  review of another edition
I had been asked, at one point, to recommend an algorithm book to a layman.

While I was wavering between O'Reilly's odd "Algorithms in a Nutshell" and the quite good (but more technical) "Algorithms" by Dasgupta/Papadimitriou/Vazirani, this book by Cormen came out. I blasted through it on the beach during vacation and found it perfect.


This is a book for people interested in how computers (or computer programmers) solve problems. It quite naturally requires a mathematical inclination, but unlike m
...more
Mohannad Hassan
Written by Thomas Cormen because the Introduction to Algorithms has been deemed too technical by the MIT Press!

Professor Cormen intended to make this book an in-between book between the very theoretical books and the very techincal books. He didn't assume much scientific or mathematical background knowledge for the readers. In other words it's not actually intended for people on the field.

How easy is it for people from outside the field? I can't say! It wouldn't be impossible to understand. I'd
...more
Wanda
Dec 31, 2016 Wanda rated it really liked it
This book gives a great overview of a broad variety of topics in algorithms, and supplies a decent amount of technical detail in the form of pseudocode and some fairly meaty proof outlines (enough to prepare for a more comprehensive text, such as CLRS). Somehow, I found the section on PERT charts almost as difficult as puzzling through the reduction of 3-CNF to the subset sum problem... I think the examples presented in those sections served to muddy the technique required, unlike the clarity pr ...more
Paweł Sobiegraj
Wreszcie znalazłem czas żeby skończyć. Lekko napisana książeczka o algorytmach. Dywagacje ZPL o tłumaczeniu różnych pojęć do zaakceptowania i nie doskwierają mocno.

Niestety jakość edytorska Helionu nadal pozostaje na niskim poziomie. Ginące wypunktowania, opisy rysunków czy tabel z tej samej strony, jakby były na stronie następnej zdarzają się często. Obyło się bez błędów w pseudokodzie, ale literówki w oznaczeniach zbiorów(lub grafów), albo błędne słowa(krawędź zamiast wierzchołka) też się poj
...more
Jesús Navarrete
The book is good to see some algorithms without mathematical demonstration. If you want to remember how they works or if you never see algorithms before. For me was nice to read in a few pages to remember things. Although I was thinking that the book was to see problems or algorithms applied without to much maths.

There is a part at the end speaking about the what are the problems open. In general it is interesting to read but not what I was looking for.
Vladimir Ryashentsev
Книга требует привычки к сухому математическому языку.
Она с одной стороны не подойдет человеку изучавшему математику на уровне школьной программы, но человеку сильному в математике эта книжка может показаться поверхностной, обрывочной, скачащей с темы на тему.
Adel
Feb 02, 2014 Adel rated it it was amazing  ·  review of another edition
A very good book for beginners, anyone who wants to know the basics should start with this book.
Mills College Library
005.1 C811 2013
Aura Mora
Jun 04, 2016 Aura Mora rated it really liked it  ·  review of another edition
It's a great step-by-step explanation of the basic algorithms. Non-technical, perfect for programmers and non-programmers.
Steve Gross
Dec 25, 2015 Steve Gross rated it really liked it  ·  review of another edition
Serious, but humorous introduction to computer algorithms. Not for first timers.
Enoch Adablah
what are the different characteristics of algorithm
Alexander Morozov
Жаль что не попалась раньше, самое то для тех кому это нужно для работы без фанатизма.
Теперь понятнее стали критерии оценки эффективности работы алгоритмов.
Sefa
Oct 12, 2013 Sefa rated it really liked it  ·  review of another edition
Shelves: computer-science
Nice introduction to algorithms for layperson.
Mike
Mike rated it really liked it
Feb 18, 2016
Valbona Brahaj
Valbona Brahaj rated it it was amazing
Mar 22, 2017
Nishant
Nishant rated it liked it
Jan 10, 2017
Roope Kuutti
Roope Kuutti rated it liked it
Dec 03, 2013
Amy
Amy rated it liked it
Jul 06, 2015
Joe
Joe rated it it was amazing
Mar 09, 2016
Uzra Arif
Uzra Arif rated it liked it
Mar 08, 2014
Pooshan
Pooshan rated it it was amazing
Nov 24, 2015
ne
ne rated it really liked it
Sep 29, 2016
Vikramjit
Vikramjit rated it really liked it
Aug 06, 2015
Michael Moran
Michael Moran rated it really liked it
May 06, 2015
Sravan Upadrasta
Sravan Upadrasta rated it it was amazing
Nov 03, 2013
« previous 1 3 4 5 6 7 next »
There are no discussion topics on this book yet. Be the first to start one »
  • Understanding Computation: From Simple Machines to Impossible Programs
  • Introduction to Information Retrieval
  • The Algorithm Design Manual
  • Introduction to Algorithms: A Creative Approach
  • Nine Algorithms That Changed the Future: The Ingenious Ideas That Drive Today's Computers
  • Elements of Programming Interviews: The Insiders' Guide
  • Algorithms
  • The New Turing Omnibus: 66 Excursions In Computer Science
  • Domain-Specific Languages
  • Good Math: A Geek's Guide to the Beauty of Numbers, Logic, and Computation
  • Concurrent Programming in Java: Design Principles and Pattern
  • A Discipline of Programming
  • Modern Operating Systems
  • Python Programming for the Absolute Beginner
  • The Practice of Programming (Addison-Wesley Professional Computing Series)
  • Hacker's Delight
  • Pearls of Functional Algorithm Design
  • Algorithmic Puzzles

Goodreads is hiring!

If you like books and love to build cool products, we may be looking for you.
Learn more »
Thomas H. Cormen is the co-author of Introduction to Algorithms, along with Charles Leiserson, Ron Rivest, and Cliff Stein. He is a Full Professor of computer science at Dartmouth College and currently Chair of the Dartmouth College Writing Program.

More about Thomas H. Cormen...

Share This Book



“By the way, if you’re wondering where the word “algorithm” comes from, Knuth says that it derives from the name “al-Khowârizmî,” a ninth-century Persian mathematician.” 1 likes
More quotes…