[Greedy] Activity Selection Problem

link

Question

Given n activities with their start and finish times.

Select maximum number of activities that can be performed in one run.

Example:

     start[]  =  {1, 3, 0, 5, 8, 5};
     finish[] =  {2, 4, 6, 7, 9, 9};

     output[] = {0, 1, 3, 4}

Solution

Greedy algorithm, according to gfg:

1. Sort the activities according to their finishing time

2. Select the first activity from the sorted array and print it.

3. For the rest, if start time is greater than previous finish time, then select this activity.

Code

not written.