First come first served (FCFS)

#include<stdio.h>
void main(){
    int bt[50], at[50], wt[50],tat[50], i, n;
    float wtavg, tatavg;
    printf("\nEnter the number of process: ");
    scanf("%d", &n);
    for(i=0; i<n;i++){
        printf("\P%d bust and arrival time : ", i);
        scanf("%d,%d", &bt[i]);
        scanf("%d", &at[i]);
    }
    wt[0]= wtavg = 0;
    tat[0] = tatavg = bt[0];
    for(i=1;i<n;i++){
        wt[i] = wt[i-1] +bt[i-1] -at[i];
        tat[i] = tat[i-1] +bt[i] -at[i];
        wtavg = wtavg + wt[i];
        tatavg += tat[i];
    }

    printf("%f",tatavg);

    printf("\nPROCESS \tBURST \t ARRIVAL  \t WAITING \t TURNAROUND");
    for(i=0;i<n; i++){
       printf("\nP%d \t\t %d \t %d \t\t %d \t\t %d", i, bt[i], at[i], wt[i], tat[i]);
    }
    printf("\nAverage Waiting Time -- %f", wtavg/n);
    printf("\nAverage Turnaround Time -- %f", tatavg/n);
}