Non Preemptive SJF scheduling algorithm in C
Non Preemptive SJF scheduling algorithm in C. This is a working code with output. If you want the explanation for this code, you can view: this video YouTube Link #include <stdio.h> typedef struct process { int id , at , bt ,rt, ct , tat , wt; } process; void display(process proc[] , int n) { int i; printf("\n\nP AT BT CT TAT WT\n"); for(i = 0; i 0) { int min = -1; for(i = 0; i 0) { if(min == -1 || proc[i].rt