Four prospectors with only one lantern must walk through a mineshaft. At most, two prospectors can travel together and any prospector in the shaft must be with the lantern. The prospectors, named Andrews, Blake, Johnson, and Kelly, can walk through the shaft in one minute, two minutes, four minutes, and eight minutes, respectively. When two walk together they travel at the speed of the slower prospector. How can the prospectors get through the mineshaft in only 15 minutes? After you have solved this problem, explain how you got your foot in the door.
I need to make an algorithm for this. help.
No one is going to do your homework for you.
At least attempt it first so we know what to help you with.
I have the problem solved i just have to write a recursive algorithm to multiply two numbers. Mult(a,b) = a Mult(a,(b-1))+a if b = 1 if b > 1. But i am having trouble putting it all together
Sorry, you need to Log In to post a reply to this thread.