I am looking for professional who has very good knowledge and understanding of data structures and algorithms and can code in C#. I need help with following topics.
1. explain Document Backtracking versus Branch-and-Bound design approaches in writing.
2. Implement selection sort and insertion sort, document run time complexity. Binary Search versus Interpolation Search. Write code in C#
3. (Divide and Conquer, Dynamic Programming, Greedy Approach, Backtracking, or Branch-and-Bound) which one to use and why
12 freelancers are bidding on average $128 for this job
Hello i have an background experience with Data Structures and Search/PathFinding Algorithms and have already implemented many of them in C/C++/Java for Data and Games aplication. Waiting for your contact.