C Program for Activity Selection Problem | Greedy Algo-1
Last Updated :
01 Jul, 2022
You are given n activities with their start and finish times. Select the maximum number of activities that can be performed by a single person, assuming that a person can only work on a single activity at a time. Example:
Example 1 : Consider the following 3 activities sorted by finish time.
start[] = {10, 12, 20};
finish[] = {20, 25, 30};
A person can perform at most two activities. The
maximum set of activities that can be executed
is {0, 2} [ These are indexes in start[] and
finish[] ]
Example 2 : Consider the following 6 activities
sorted by finish time.
start[] = {1, 3, 0, 5, 8, 5};
finish[] = {2, 4, 6, 7, 9, 9};
A person can perform at most four activities. The
maximum set of activities that can be executed
is {0, 1, 3, 4} [ These are indexes in start[] and
finish[] ]
C++
#include <stdio.h>
void printMaxActivities( int s[], int f[], int n)
{
int i, j;
printf ( "Following activities are selected n" );
i = 0;
printf ( "%d " , i);
for (j = 1; j < n; j++) {
if (s[j] >= f[i]) {
printf ( "%d " , j);
i = j;
}
}
}
int main()
{
int s[] = { 1, 3, 0, 5, 8, 5 };
int f[] = { 2, 4, 6, 7, 9, 9 };
int n = sizeof (s) / sizeof (s[0]);
printMaxActivities(s, f, n);
return 0;
}
|
Output:
Following activities are selected n0 1 3 4
Please refer complete article on Activity Selection Problem | Greedy Algo-1 for more details!
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...