algorithm study

I need someone who is perfect in these topics--- Mathematical Foundations • Sorting and analysis • Divide-and-conquer • Dynamic programming • Greedy techniques • Advanced data structures • Graph algorithms • NP-completeness. Know the characteristics of classic algorithm design strategies (e.g. brute-force, divide-and-conquer, dynamic programming, greedy approaches) • Be able to analyze expected performance of a given algorithm • Be able to apply mathematical techniques to demonstrate that an algorithm is correct • Be able to modify known algorithms and to develop new algorithms to cope with modified contexts.