Shortest-Job-First (SJF)

C Program For Shortest-Job-First (SJF)

Source Code:


#include <stdio.h>
#include <stdlib.h>

int main()
{
        int n, i, j, arr[20], min, done[20], wt[20],tt[20], sum =0;
        printf("Enter The number of Process: ");
        scanf("%d", &n);

        for (i = 0; i < n; ++i) {
				printf("Enter Te Brust Time Of P%d: ", i);
                scanf("%d", &arr[i]);
				done[i] = 0;
        }

        for (i = 0; i < n; i++) {
			min = 0;
			for (j = 1; j < n; j++) {
				if(arr[j] < arr[min] && done[j] != 1) {
					min = j;
				}
		}
			wt[min] = sum;
			done[min] = 1;
			printf("(P%d )", min);
			sum += arr[min]; 
			tt[min] = sum;	
        }
		printf("\nProcs\tWtime\tTTime");

		for(i=0;i <n;i++) {
			printf("\nP%d\t%d\t%d",i, wt[i],tt[i]);
		}
		getch();
        return 0;

}