Design algorithm problem

Main Question or Discussion Point

Hi :smile:
This is a simple algothim problem,please help me solve it .I think its a greedy problem
Here it is:
-------------------
A native austratial named anatjari wants to cross a desert carrying only one bottle of water.He has a map that marks all the watering holes along the way .Assuming he can walk k miles on one bottle,design an eff. algo for determining where anatjari should stop to minimize the num of stops.
--------------------
It is not clear how the holes are marked in the map so i am assuming the desert to be a long straight path.
Any help would be appreciated.
TIA.
r_b_cragon :confused:
 

Answers and Replies

Zurtex
Science Advisor
Homework Helper
1,120
1
What have you done so far?
 

Related Threads for: Design algorithm problem

Replies
5
Views
2K
Replies
1
Views
2K
  • Last Post
Replies
14
Views
6K
  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
13
Views
4K
  • Last Post
Replies
1
Views
3K
  • Last Post
3
Replies
52
Views
8K
  • Last Post
Replies
3
Views
2K
Top