You must know:
1. DP: Knapsack, matrix chain, longest common subsequence, transitive closure of a graph, Floyd-Warshall algorithm
2. Sorting: mergesort, quicksort, heapsort, heapification
3. Algorithms: asymptotic notation of running time complexity, space and time complexity, order of growth of functions
No coding is required
5 freelancere byder i gennemsnit $52 timen for dette job
Hi I can help you with my skill. I have many experiences with Algorithm projects. Please let me know your project more detail. I will serve good result if you hire me. Thank you.