Hello I need some clarification & help with questions on the following topics.
Computational Complexity (Turing Machines)
Greedy Algorthms(Optimal Substructure,Greedy Choice Property,dynamic vs greedy algorithm)
Loop Invariants(Bubble Sort)
Activity Selection Problems
Safe Edge(Spanning tree)
Prims Algorithim(Min spanning tree)
Please Note the questions i have are not a Programming based
28 freelancers are bidding on average $124 for this job
I was a competitive programmer, and I know all of those algorithms. I can work right now. Please contact me to discuss in detail. Thank you in advance.
hey there, with more than 5 years of research and teaching experience in Design and Analysis of Algorithms, i can explain you all the topics in a very simple and an effective to make it a perfect bid for both of us :)
Hi, I have prior teaching experience & have taught Algorithms, Data Structures & Programming Fundamentals at University. I can guide you in your studies in mentioned topics.