Related. Others?<p><i>Algorithms by Jeff Erickson</i> - <a href="https://news.ycombinator.com/item?id=26074289">https://news.ycombinator.com/item?id=26074289</a> - Feb 2021 (152 comments)<p><i>Algorithms book, by Jeff Erickson</i> - <a href="https://news.ycombinator.com/item?id=20733923">https://news.ycombinator.com/item?id=20733923</a> - Aug 2019 (13 comments)<p><i>Algorithms, by Jeff Erickson</i> - <a href="https://news.ycombinator.com/item?id=18805624">https://news.ycombinator.com/item?id=18805624</a> - Jan 2019 (238 comments)<p><i>Algorithms, Etc. (2015)</i> - <a href="https://news.ycombinator.com/item?id=16379236">https://news.ycombinator.com/item?id=16379236</a> - Feb 2018 (6 comments)<p><i>Algorithms Course Materials, by Jeff Erickson</i> - <a href="https://news.ycombinator.com/item?id=3345041">https://news.ycombinator.com/item?id=3345041</a> - Dec 2011 (2 comments)
How does this compare to the (better-known IIANM) Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein?<p><a href="https://en.wikipedia.org/wiki/Introduction_to_Algorithms" rel="nofollow noreferrer">https://en.wikipedia.org/wiki/Introduction_to_Algorithms</a>
<p><pre><code> Table of Contents
1. Recursion
2. Backtracking
3. Dynamic Programming
4. Greedy Algorithms
5. Basic Graph Algorithms
6. Depth-First Search
7. Minimum Spanning Trees
8. Shortest Paths
9. All-Pairs Shortest Paths
10. Maximum Flows & Minimum Cuts
11. Applications of Flows and Cuts
12. NP-Hardness
</code></pre>
Each chapter has more detailed subsections in the full TOC, but this gives an overall outline.
The book might be more aptly called 'advanced algorithms' as the prerequisites clearly indicate a need for a solid understanding of discrete mathematics, all fundamental data structures, and proficiency in basic algorithms related to searching, sorting, and graph theory.
First chapter questions:<p>(a) Identify (or write) a song that requires Θ(n3) time to sing the first n
verses.<p>(b) Identify (or write) a song that requires Θ(nlog n) time to sing the first
n verses.<p>(c) Identify (or write) a song that requires some other weird amount of
time to sing the first n verses.<p>Any ideas?
I reviewed this, it was “okay” but some part disagreed with me.<p>A better treatment is Tim Roughgarden. Not free, but not expensive either. Worth every penny and then some. (I learned of it from a HN commenter.)