recurrsion

knapsack
tree problem

greedy and minimum

substitution introduction dynamic spanning
method to daa programming tree

asympotic design huffmann

notations analysis and coding

algorithms
binary back and
search bound

randomised and knapsack

master backtracking
divide and approximation problem
theoram algorithm
conqurer graph
sorting algorithm

types of rabim karp satisfiability

problem algorithm problem