I need a solution / algorithm for the following questions:
1- Given 5 sets of cables, for e.g. Red, Blue, Green, Yellow, Black, which has been tangled together unknown number of times, find an algorithm that uses the optimum number of steps to untangle all five cables.
2- Modify your solution for 'n' number of cables
17 freelance font une offre moyenne de $187 pour ce travail
This sounds like an interesting problem, but the problem statement is not entirely clear to me. Can I think of this as n cables that are clamped at either end and tangled in between? Would one step consist of exchangin Plus
I have an in-depth understanding of algorithms and optimization and would be very interested in your project. Please see your inbox for further details.
I generate new idea of math game. I am confident enough to do this. I believe in work more than words.
We checked your posting in detail and based on that we are ready to do work as per your budget and timing and we are ready to discuss the things with you
I have already solved the problem after seeing this project.. I hope you will be able to have the solution and technique as soon as you respond
I am good at math and C program, I think your question is piece of cake. So I want to help you to solve it. Never mind the bid money and I can do it free for you. I bid that monoy just for the permission by server. So Plus