activity selection problem
TRANSCRIPT
![Page 1: Activity selection problem](https://reader036.vdocuments.us/reader036/viewer/2022062503/58ecec0f1a28abc7368b46a5/html5/thumbnails/1.jpg)
![Page 2: Activity selection problem](https://reader036.vdocuments.us/reader036/viewer/2022062503/58ecec0f1a28abc7368b46a5/html5/thumbnails/2.jpg)
![Page 3: Activity selection problem](https://reader036.vdocuments.us/reader036/viewer/2022062503/58ecec0f1a28abc7368b46a5/html5/thumbnails/3.jpg)
![Page 4: Activity selection problem](https://reader036.vdocuments.us/reader036/viewer/2022062503/58ecec0f1a28abc7368b46a5/html5/thumbnails/4.jpg)
![Page 5: Activity selection problem](https://reader036.vdocuments.us/reader036/viewer/2022062503/58ecec0f1a28abc7368b46a5/html5/thumbnails/5.jpg)
![Page 6: Activity selection problem](https://reader036.vdocuments.us/reader036/viewer/2022062503/58ecec0f1a28abc7368b46a5/html5/thumbnails/6.jpg)
![Page 7: Activity selection problem](https://reader036.vdocuments.us/reader036/viewer/2022062503/58ecec0f1a28abc7368b46a5/html5/thumbnails/7.jpg)
![Page 8: Activity selection problem](https://reader036.vdocuments.us/reader036/viewer/2022062503/58ecec0f1a28abc7368b46a5/html5/thumbnails/8.jpg)
Activity-selection Problem
![Page 9: Activity selection problem](https://reader036.vdocuments.us/reader036/viewer/2022062503/58ecec0f1a28abc7368b46a5/html5/thumbnails/9.jpg)
Example:
A :
![Page 10: Activity selection problem](https://reader036.vdocuments.us/reader036/viewer/2022062503/58ecec0f1a28abc7368b46a5/html5/thumbnails/10.jpg)
Define the Problem
![Page 11: Activity selection problem](https://reader036.vdocuments.us/reader036/viewer/2022062503/58ecec0f1a28abc7368b46a5/html5/thumbnails/11.jpg)
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