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
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 exchanging the position of two cables at one end?
You also said that the cables are tangled an unknown number of times. So how do you know if they are less tangled after one step?
Please clarify, if you might want me to work on this project. Thanks!
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 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 glad to meet you.