02-greedy

Feasible solutions that scores highest by the

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: al solution to a sub-problem Show that making the greedy choice will yield an optimal solution to the overall problem Show that it has optimal sub-structure 2. Show that a solution to a problem contains optimal solutions to sub-problems . Or 97 induction! Warning! Proving that an algorithm makes a greedy choice at each stage is NOT the same as showing that the algorithm has the greedy choice property The first is a property of the algorithm designed The second shows that making the greedy choice will yield an optimal solution to the overall problem 98...
View Full Document

This note was uploaded on 02/25/2014 for the course CS 4102 taught by Professor Horton during the Spring '10 term at UVA.

Ask a homework question - tutors are online