Some of the contents can be found in CLRS’s Algorithms book.
A good introduction of master theorem can be found here.
Some classical NP problems are:
- Hamiltonian path problem
- Travelling Salesman Problem (TSP)
- Hill Climbing
- Tabu search
Longest-Common-Subsequence (LCS) problem.