shortest_job_first_scheduling.cpp

#include<iostream>
using namespace std;
int main()
{
    int n,i,j;
    cout<<"Enter the number of processes: ";
    cin>>n;
    int bt[n],p[n],wt[n],tt[n],pr[n];
    cout<<"Enter the burst time of each process: ";
    for (i=0;i<n;i++)
    {
        cin>>bt[i];
    }
    for(i=0;i<n;i++)
    {
        p[i]=i;
    }
    for(i=0;i<n;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(bt[i]>bt[j])
            {
                swap(bt[i],bt[j]);
                swap(p[i],p[j]);
            }
        }
    }
    wt[0]=0;
    cout<<"Waiting time of each process is: ";
    for(i=1;i<n;i++)
    {
        wt[i]=wt[(i-1)]+bt[(i-1)];
    }
    for(i=0;i<n;i++)
    {
        cout<<"\nwt["<<i<<"] :"<<wt[i];
    }
    for(i=0;i<n;i++)
    {
        tt[i]=wt[i]+bt[i];
    }
    for(i=0;i<n;i++)
    {
        cout<<"\ntt["<<i<<"]  :"<<tt[i];
    }
    float avgwt=0,avgtt=0;
    for(i=0;i<n;i++)
    {
        avgwt=avgwt+wt[i];
        avgtt=avgtt+tt[i];
    }
    avgwt=avgwt/n;
    avgtt=avgtt/n;
    cout<<"\n\n Average waiting time: "<<avgwt;
    cout<<"\n Average turn around time: "<<avgtt;
    return 0;
}