Reddit Reddit reviews Algorithms Unlocked (The MIT Press)

We found 7 Reddit comments about Algorithms Unlocked (The MIT Press). Here are the top ones, ranked by their Reddit score.

Computers & Technology
Books
Computer Programming
Programming Algorithms
Algorithms Unlocked (The MIT Press)
Mit Press
Check price on Amazon

7 Reddit comments about Algorithms Unlocked (The MIT Press):

u/_vikram · 9 pointsr/learnprogramming

He has a more readable version called Algorithms Unlocked. It covers search, sort, graphs, cryptography, shortest path, data compression and other topics pretty well.

u/sick_anon · 8 pointsr/algorithms

I suggest you to not waste too much time reading 15 different books on algorithms or spreading on 15 different resources (YT videos, online courses, forums, tutorials, etc.). Stick to 1 or 2 good books (try Introduction to Algorithms and, if you're completely new to algorithms, and have no idea what are they and what is their role in computer science and science in general, I recommend book by same author that could make a good preparation to previous book; it's called Algorithms Unlocked ) and start applying that knowledge in the run (solving problems). Remember: don't waste time on hundreds of resources; they may be great and offer some really high quality information about topic, but you just don't have time to go through all of them. Good luck!

u/MmmCurry · 5 pointsr/compsci

Not specific to algorithms or even to CS, but Douglas Hofstadter (Gödel, Escher, Bach, I Am a Strange Loop) touches on many of the logical fundamentals in a relatively layman-digestable manner.

I wouldn't call him easy reading compared to Sagan or Kaku, and don't know a "pop computer science" equivalent to those two, but you definitely don't need a CS or math degree to get through GEB. Whether it's on-topic enough here is definitely questionable.

---

Edit: I haven't read it, but from the description this one by Thomas Cormen looks like it might be close to what you're looking for: Algorithms Unlocked.

"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."

From the TOC, it looks like it's probably fairly light on math but gets into code or pseudocode relatively quickly. I still wouldn't call it pop-CS, but if that sounds like a fit, maybe give it a shot!

u/mrstacktrace · 1 pointr/learnprogramming

I highly recommend Algorithms Unlocked by Thomas Cormen (one of the authors of the famous CLRS book)

It's very readable; it's about 240 pages. It's basically a bit of a simplified, summarized version of CLRS. He takes time to walk through the algorithms with "real-world" examples, and gives you the algorithmic analysis as well. It doesn't contain the mathematical rigor or any of the problems/exercises of CLRS. It's supposed to be approachable by people who are not CS majors (but do have some Math under their belt).

It's a perfect book to read before studying CLRS, during, and even after (when you are in the industry and haven't touched CLRS since you graduated and you want to prepare for interviews).

u/benfitzg · 1 pointr/compsci

Thanks - wasn't aware of this

u/verifiedOFFICIAL · 1 pointr/cscareerquestions

http://www.buildingjavaprograms.com/

http://www.amazon.com/Building-Programs-Student-Value-Edition/dp/0133375277

A great and intuitive textbook used at a lot of high-powered CS intro classes. Particularly useful for a "interview-level" understanding of OO and proper use of key data structures. Probably not enough info on algorithms, but you can use knowledge from this book to implement the key ideas in "Algorithms Unlocked,"
(http://www.amazon.com/Algorithms-Unlocked-Thomas-H-Cormen/dp/0262518805) which is basically CLRS junior.

u/Slayer706 · 1 pointr/programming

There is another book by one of those authors that's supposed to be more approachable for people without CS degrees. I haven't read it, but it's on my wish list: http://www.amazon.com/Algorithms-Unlocked-Thomas-H-Cormen/dp/0262518805/ref=pd_sim_b_11