#include<stdio.

h>
void main()
{
int serv[10][2],tempo[1][2];
int i,j,n,totoal;
float average_time,average_wait;
printf( shortest job first sjf scheduling program in c \t\n );
printf( enter number of process\n );
scanf( %d ,&n);
for(i=0;i<n;i++)
{
printf( \nenter serv time of %d process\n ,i+1);
serv[i][0]=i;
scanf( %d ,&serv[i][1]);
}
serv[0][1]=serv[0][1]-1;
for(i=0;i<n;i++)
{
for(j=0;j<n-1;j++) { tempo[0][0]=0; tempo[0][1]=0; if(serv[j][1]>=serv[j+1][1])
{
tempo[0][1]=serv[j][1];
tempo[0][0]=serv[j][0];
serv[j][1]=serv[j+1][1];
serv[j][0]=serv[j+1][0];
serv[j+1][1]=tempo[0][1];
serv[j+1][0]=tempo[0][0];
}
}
}
totoal=1;

average_time=0;
for(i=0;i<n;i++)
{
totoal=totoal+serv[i][1];
average_time=average_time+(totoal-serv[i][0]);
}
average_wait=average_time/n;
printf( average waiting time for sjf is: %f ,average_wait);
}