#include <stdio.h>

struct process {
    int pid;
    int burst_time;
};

void sort(struct process p[], int n) {
    int i, j;
    struct process temp;
    
    for(i=0; i<n-1; i++) {
        for(j=i+1; j<n; j++) {
            if(p[i].burst_time > p[j].burst_time) {
                temp = p[i];
                p[i] = p[j];
                p[j] = temp;
            }
        }
    }
}

void sjf(struct process p[], int n) {
    int i, total_time = 0;
    float avg_wait_time = 0, avg_turnaround_time = 0;

    sort(p, n);

    printf("\nProcess\tBurst Time\tWaiting Time\tTurnaround Time\n");

    for(i=0; i<n; i++) {
        printf("%d\t%d\t\t%d\t\t%d\n", p[i].pid, p[i].burst_time, total_time, total_time+p[i].burst_time);
        avg_wait_time += total_time;
        avg_turnaround_time += total_time+p[i].burst_time;
        total_time += p[i].burst_time;
    }

    avg_wait_time /= n;
    avg_turnaround_time /= n;

    printf("\nAverage Waiting Time: %.2f", avg_wait_time);
    printf("\nAverage Turnaround Time: %.2f", avg_turnaround_time);
}

int main() {
    int n, i;
    printf("Enter the number of processes: ");
    scanf("%d", &n);

    struct process p[n];

    for(i=0; i<n; i++) {
        printf("\nEnter the burst time for process %d: ", i+1);
        scanf("%d", &p[i].burst_time);
        p[i].pid = i+1;
    }

    sjf(p, n);

    return 0;
}