Knowledgable with analysis of algorithms

Must be knowledgeable about these topics: Divide and Conquer, Recurrence Relations, Master Method, Dynamic Programming, Nearest Neighbor Problem, 0-1 knapsack, subset sum problem, Sequence Alignment Problem, and Network Flow. Looking for a tutor who can tutor and also help with te.st taking.