Greedy algorithms

Exercise $1$

You are given n activities with their start and finish times $($represented by arrays s and f$).$ Select the maximum number of activities that can be performed by a single person, assuming the person can only work on one activity at a time.

Set of activities $=\{a_1,a_2,$dots,$a_n\}.$

Array of start times $=s$

Array of finish times $=f$

Hint: Assume the activities are sorted by their finish times. Always choose the next activity with the earliest finish time that starts after the last selected activity ends.

Greedy algorithms

Exercise $1$

You are given n activities with their start and finish times $($represented by arrays s and f$).$ Select the maximum number of activities that can be performed by a single person, assuming the person can only work on one activity at a time.

Set of activities $=\{a_1,a_2,$dots,$a_n\}.$

Array of start times $=s$

Array of finish times $=f$

Hint: Assume the activities are sorted by their finish times. Always choose the next activity with the earliest finish time that starts after the last selected activity ends.