fcfs with arrival time.cpp

#include<bits/stdc++.h>
using namespace std;

int main()
{
int n,p,b[100], w=0,t,temp=0,arvTime[100];
float awt =0,att=0, aw=0, at=0;

printf("Enter the process no : ");
scanf("%d",&n);

for(int i=0; i<n; i++)
{
printf("Enter the burst time for process %d : ",i+1);
cin>>b[i]>>arvTime[i];
}

//sort(b,b+n);

for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
if(b[i] <b[j]){
temp = b[i];
b[i] = b[j];
b[j] = temp;

temp = arvTime[i];
arvTime[i] = arvTime[j];
arvTime[j] = temp;


}
}
}



printf("Process \t bt \t wt \t tt");

for(int i=0; i<n; i++)
{
t = w-arvTime[i]+b[i];
printf("\n %d \t\t %d \t %d \t %d", i+1,b[i],w-arvTime[i],t);
at = at + t;
aw = aw+w-arvTime[i];
w = w+b[i];

}
att = at/n;
awt = aw/n;

printf("\n Average waiting time: %f and average turnedaround time: %f",awt,att);


return 0;
}