Question

A native Australian named Anatjari wishes to cross a desert carrying only a single water bottle. He has a map that marks all the watering holes along the way. Assuming he can walk k miles on one bottle of water, design an efficient algorithm for determining where Anatjari should refill his bottle in order to make as few stops as possible. Argue why your algorithm is correct.​

Answer 1

Answer:While following a treasure map, you start at an old oak tree. You first walk 825 m directly south, then turn and walk 1.25 km at 30.0∘ west of north, and finally walk 1.00 km at 32.0∘ north of east, where you find the treasure: a biography of Isaac Newton! (a) To return to the old oak tree, in what direction should you head and how far will you walk? Use components to solve this problem. (b) To see whether your calculation in part (a) is reasonable, compare it with a graphical solution drawn roughly to scale.

Explanation: (a) is reasonable, compare it with a graphical solution drawn roughly to scale.