Algorithm Problem Solving

I have put up many algorithm problems on this blog and some of them took me a hell lot of time to solve. I thought to release some of the important reading material which I had accumulated (but never used ) over the years. In this post I will put up material which is more mathematical oriented and useful for background reading.

• This is a classic set of 10 standard problems on Dynamic Programming. Make sure you’ve solved each one of them.
• This is a recipe for the Computational Geometry enthusiasts. A good read to get started into the subject.
• This is a nice small tutorial on Generating Functions. Generating functions are very handy in solving mathematically oriented programming problems.
• This is the best resource on Function Pointers. Everything, from amateur to pro are discussed very nicely.
• This is a concise introduction to Number Theory for Computer Science.
• This is a nice book on Introduction to Computer Algorithms. People have blindfolded faith in CLRS, I would suggest to look into this book once. Worth a read.
• This is a collection of notes on NP-completeness and Algorithm Analysis and Complexity. Nice to read for theorists.
• This is an awesum book on Programming Contests preparation guide.
• This is the Programming Pearls. No need to introduce this book .

  Now here is a list of 3 books which are written by some of the most prominent people of this century and are of interest to non-readers (like me).

• This is a classic book again by Feynman which can make you realise how joyous our findings can be to us.
• This is the famous book by Hardy. “A Mathematicians Apology” is considered to be a classic read.
• This is a book by one of the most prominent figures on 20th century Albert Einstein. The World as he saw.

Hope you find joy in going through these books.