Algorithms unlocked

Name: Algorithms unlocked
ISBN: 0262518805

by Thomas H. Cormen · first published 2013

10mentions

7recommended by

8HN commenters

2013–2021first – last mentioned

88% recommend13% neutral

Why HN recommends it

Accessible, low-jargon introduction to what algorithms do and why they work, written by the CLRS co-author; suited to self-taught programmers and developers wanting a short, conceptual overview before a textbook.

Summarised by Claude from recommending comments

Computer Science Programming Software Engineering

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

BuyBookshop.org Amazon

Affiliate links. As an Amazon Associate I earn from qualifying purchases.

View on Open Library ISBN 0262518805

Mentions per year

What Hacker News says

imakecomments · Feb 16, 2017 · Recommends

…in my opinion detracts from the material. Also, he doesn't always fully explain where he got some of the big ohs here and there. My advice? Follow MIT's OCW course (it uses CLRS). Supplement it with Algorithms Unlocked, the Khan Academy link in OP and CLRS. If you use those 4 resources and put in the work you'll understand the material. All 4 sources have Thomas C's DNA touch to it (he is the C in CLRS). So you'll…
on “Algorithms” ↗
stiff · Oct 23, 2013 · Recommends

…very well, it isn't that much in the focus of the book, they implement a queue in one place from what I remember, there is some mention of big-oh, but it's all rather cursory. Thomas Cormen published "Algorithms Unlocked" recently, which seems like a good intro book for programmers who are not willing to devote a fraction of their life to studying the big Cormen book or Knuth. - Constant factors matter increasingly more…
on “Choosing the right data structures” ↗
imakecomments · Dec 6, 2016 · Recommends

…look at a rigorous course offering of Algorithms. MIT has a few online to view. Some readings for a beginner are: https://www.khanacademy.org/computing/computer-science/algor... https://www.amazon.com/Algorithms-Unlocked-Press-Thomas-Corm... https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press... (not beginner level but classic) After all of this you should be fine with diving into interview books. You'll want…
on “Want a Job in Silicon Valley? Keep Away from Coding Schools” ↗
earthicus · Feb 16, 2019 · Recommends

…problems. Lawvere & Schanuel- Conceptual Mathematics. Some basic notions of category theory, geared towards teaching you Lawvere's clarification and generalization of the incompleteness theorems. Cormen - Algorithms Unlocked. Pop Science version of some of the textbook. Nahin - Inside interesting Integrals. Lots of fun integrations! Nahin - He also wrote some books about euler and imaginary numbers which ive partially read,…
on “Classic Mathematics Books for Lifelong Learners” ↗
dhissami · May 4, 2013 · Recommends

…Java): http://www.amazon.com/Algorithms-4th-Edition-Robert-Sedgewic... They also teach a two-part Algorithms course on Coursera: https://www.coursera.org/courses?orderby=upcoming&search... Thomas Cormen (the C in CLRS) also has a new book called Algorithms Unlocked which introduces some popular algorithms in pseudocode. http://www.amazon.com/Algorithms-Unlocked-Thomas-H-Cormen/dp...
on “Big-O Algorithm Complexity Cheat Sheet” ↗
pamelafox · Nov 18, 2014 · Recommends

Yes, Cormen thinks that Algorithms Unlocked is actually a much better book for the crowd that would likely use this content. I put more links in this article at the end, with recommendations from someone who runs an Algorithms study group for mostly…
on “Algorithms on Khan Academy – a collaboration with Dartmouth College professors” ↗
imakecomments · Feb 15, 2017 · Recommends

As a follow up to this resource I recommend, Algorithms unlocked: https://www.amazon.com/Algorithms-Unlocked-Press-Thomas-Corm... CLRS: https://www.amazon.com/Introduction-Algorithms-3rd-MIT-Press... Both include the same author as the one in this article (Thomas…
on “Algorithms” ↗
neurocline · Jun 2, 2020 · Recommends

I went through my recent-books shelves and found a few shorter books that are well worth reading. Short books for developers are rare these days. Algorithms Unlocked, Thomas Cormen, 212 pages The Art of Readable Code, Dustin Boswell & Trevor Foucher, 180 pages How To Take Smart Notes, Sonke Ahrens, 151 pages How to Write a Thesis, Umberto Eco, 223 pages How Charts…
on “Ask HN: Best books under 200 pages for developers?” ↗
atsheehan · Dec 9, 2021 · Recommends

I liked "Algorithms Unlocked" by Cormen (https://mitpress.mit.edu/books/algorithms-unlocked). It's the same author that co-wrote "Introduction to Algorithms" (or CLRS) that's referenced in a few other comments, but this one focuses…
on “Ask HN: I'm looking for a good book on the fundamentals of CS” ↗
bhaumik · Nov 18, 2014 · Mentions

…Algorithms, Data Structures, and other CS theory concepts. CLRS was highly recommended but without a technical background, I wasn't able to dive in as quickly as I hoped. A few days ago, I purchased a copy of Algorithms Unlocked [1] which was described as a "prequel" to CLRS. This review in particular grabbed my attention: "The people who will get the most out of this book are self-taught programmers who have never taken a course…
on “Algorithms on Khan Academy – a collaboration with Dartmouth College professors” ↗