I've found the best way to read those sorts of books is to treat the proofs as the exercises, i.e. doing the proof blind and using the proof inside as a check.
True, but the proofs themselves are very much explained with mathematical notations. Personally, for me, It's been over 5 years since I left college and solved any math problems. I don't remember what the symbols mean anymore.
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.
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.