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
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.
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