I've to constantly keep googling what the symbols mean and takes a lot of time, turns discouraging to keep going through the material. So there's a deeper study going on in there just to understand, say- what an asymptotic notation means in the algorithmic world.
I definitely would love to dive deep into math since it is the foundation of algorithms, but it's good to have source material with beginner exercises. Maybe I'm looking at the wrong places...
I agree with your point, taking the proof as exercises will make things challenging for you.
Figure 9.2: The recursion tree for the Change-making problem with T = 10,
with duplicate calls merged.
The tree starts with 8 as well.
You wrote on my blog post on the hackathon at the time (2011) that I had "some promise for algorithmic problem solving". Really inspired me to dive into CS.