Algorithms

I like: algorithms.wtf Algorithms by Jeff Erickson

The good thing about Algorithm Design & Analysis as a topic is that there is no lack of great resources to learn from! And even better, a large portion of them are freely available online (in forms of lecture notes, or entire books, video lectures, programming challenges with online judging, etc). In addition to what others have mentioned, here are some example resources you might prefer for a beginner-intermediate level intro: 1. (free online) Algorithms by Dasgupta, Papadimitriou, and Vazirani http://algorithmics.lsi.upc.edu/docs/Dasgupta-Papadimitriou-... (http://algorithmics.lsi.upc.edu/docs/Dasgupta-Papadimitriou-Vazirani.pdf) 2. (free online) Algorithms by Jeff Erickson https://jeffe.cs.illinois.edu/teaching/algorithms/ 3. Algorithm design by Kleinberg & Tardos https://www.amazon.com/Algorithm-Design-Jon-Kleinberg/dp/032... (https://www.amazon.com/Algorithm-Design-Jon-Kleinberg/dp/0321295358)…

Jeff Erickson's Algorithms text is a great resource: http://jeffe.cs.illinois.edu/teaching/algorithms/ The entire book -- including the portions labeled Models of Computation, Director's cut, and Extended Dance Remix -- presents accessible introduction to much of the CS theory landscape. Someone already praised the shorter book titled "Algorithms" by Dasgupta et al, and I second it. Tim Roughgarden's "Algorithms Illuminated" series is in this genre too. I'd also recommend the MIT lecture notes on Mathematics for CS: https://courses.csail.mit.edu/6.042/spring18/mcs.pdf This is distinctive for its intuitive explanations with essential, approachable formalism. The exercises are fine too, if you are really mean it. Sipser's book on the Theory of Computation is great and the one by Hopcroft et al is also very good (as suggested by others). But the most beginner-friendly (or, light on math) coverage of this area is apparently in Peter Linz's book "Introduction to Formal Languages and Automata". An alternative flavor in the treatment of much of the same topics is in this free book: http://cs.brown.edu/people/jsavage/book/

Love all those books. Hadn't heard of the last one though. Looks like it's available online [1]. And actually, it has a few cool links on its homepage to similar books. In particular, there is a link to this gem [2], which, for example, has a chapter [3] on what appears to be a very interesting generalization [4] of the "master theorem" of CLRS. Another good resource that pages links to seems to be [5], which was recently mentioned on HN. Of course, for an even deeper treatment of asymptotic analysis check out Flajolet and Sedgewick [6]! [1] http://opendatastructures.org/ [2] http://jeffe.cs.illinois.edu/teaching/algorithms/ [3] http://jeffe.cs.illinois.edu/teaching/algorithms/notes/99-re... (http://jeffe.cs.illinois.edu/teaching/algorithms/notes/99-recurrences.pdf) [4] https://en.wikipedia.org/wiki/Akra%E2%80%93Bazzi_method [5] (PDF warning) http://opendatastructures.org/mcs.pdf [6] http://ac.cs.princeton.edu/home/