Basic Knowledge in Algorithms
Some of the contents can be found in CLRS’s Algorithms book.
Master Theorem
A good introduction of master theorem can be found here.
NP Problems
Some classical NP problems are:
- Hamiltonian path problem
- Travelling Salesman Problem (TSP)
Heuristic Methods
- Hill Climbing
- PSO
Metaheuristic Search
- Tabu search
Divide-and-Conquer
Dynamic Programming
Longest-Common-Subsequence (LCS) problem.