Pseudocode of Greedy Scheduler

Greedy Scheduler

Greedy_Selector( int[] s, int[] f, int n )

{

A[0] = 1;

int j = 1; k = 0;

for( int i = 2; i <= n; i++ )

{

if( s[i] >= f[j] )

{

A[k + 1] = i; //greedy choice

j= i;

}

}

return A;

}