
Algorithms
by Christos H. Papadimitriou · first published 2006
7mentions
4recommended by
7HN commenters
2012–2018first – last mentioned
57% recommend29% neutral14% critical
Affiliate links. As an Amazon Associate I earn from qualifying purchases.




…you'll be surprised how short it is compared to most textbooks. I must confess, though, that some of the exercises can be absolutely maddening. Dead tree link for those interested: http://www.amazon.com/Algorithms-Sanjoy-Dasgupta/dp/00735234...
on “Algorithms [pdf]” ↗As an older self-taught engineer who went through interviews last year this is great advice. Other books I found particularly useful were: Algorithms by Dasgupta, Papadimitriou and Vazirani: http://www.amazon.com/Algorithms-Sanjoy-Dasgupta/dp/00735234... And Elements of Programming Interviews by Aziz, Lee and Prakash: http://www.amazon.com/Elements-Programming-Interviews-Inside...
on “On Secretly Terrible (Old) Engineers” ↗I have stumbled upon Algorithms (by Sanjoy Dasgupta Algorithms (Author), Christos H. Papadimitriou Algorithms (Author), Umesh Vazirani). I find it, good for beginners, without being overwhelming. It goes like prose and not terse.
on “The Algorithm Design Manual (2008)” ↗DPV was a really good 'free' undergrad algorithms text until the publisher demanded the author's stop giving it away https://people.eecs.berkeley.edu/~christos/ "Algorithms with Sanjoy Dasgupta (Christos Papadimitriou) and Umesh Vazirani, McGraw-Hill…
on “States are moving to cut college costs by introducing open-source textbooks” ↗Whoops, seems I posted the mobile link, here's the desktop site link: http://www.amazon.com/Algorithms-Sanjoy-Dasgupta/dp/00735234... And here's the uk one: http://www.amazon.co.uk/Algorithms-Sanjoy-Dasgupta/dp/007352...
on “Algorithms [pdf]” ↗Algorithms [1] by Robert Sedgewick is particularly well written. Also, this one [2] is quite good and concise. I believe better suited for someone who is not unfamiliar with classic algorithms (like you). [1]…
on “Ask HN: Good book to learn about data structures, algorithms, Big O notation?” ↗Surprised nobody has mentioned the halting problem [1] yet, which logically proves programming can never be automated. [1] https://i.imgur.com/HVeO7ek.png (CH 8, Algorithms - Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh V. Vazirani)
on “Programming won’t be automated, or it already has been” ↗