Computer scienceAlgorithms and Data StructuresAlgorithmsPrinciples and techniques

Greedy algorithms

Budget travel within time

Report a typo

Bob is traveling from city $A$ to city $D$ via cities $B$ and $C$ . There are several ways to get from one city to another, and travel costs and times are different for different mediums. The options are depicted below:

Use the greedy algorithm

Bob wants to travel from city $A$ to city $D$ with the lowest possible cost within 15 hours. Is it possible to solve the problem using a greedy algorithm?

Select one option from the list

No, the problem doesn't have any greedy choice property

No, the problem doesn't have an optimal substructure

Yes, we can solve the problem using a greedy algorithm

___

Create a free account to access the full topic