dynamic programming

8. Activity-selection Problem

9. Example:
A :

10. Define the Problem

11. Top-down Greedy Algorithm
• Goal: to compute max activity
• Pseudo-code
– Rec-Job-Select( s,f, i, n )
m = i + 1
while (m ≤ n) and ( < )
do m = m + 1
if m ≤ n
return { }  Rec-Job-Select(s, f, m, n)
else return 
sm
fi
am