This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Your goal is to make as few gas stops as possible along the way. Give the most efficient algorithm to determine at which gas stations you should stop and prove that your strategy yields an optimal solution. Give the time complexity of your algorithm as a function of n. 2. Problem 4 in Chapter 4 3. Problem 13 in Chapter 4...
View Full Document
This note was uploaded on 02/15/2011 for the course CS 570 taught by Professor Shahriarshamsian during the Spring '08 term at USC.
- Spring '08