// 		SJF without arrival time
#include<iostream.h>
#include<conio.h>
struct process
{
	int p,bt,tat,wt;
}pro[10];

void sort();
int n;
void main()
{
	clrscr();
	int x=0,ttat=0,twt=0;
	cout<<"\t::Program for SJF scheduling without Arrival Time::";
	cout<<"\n--------------------------------------------------------------------\n\n";
	cout<<"\nEnter the no. of Processes:";
	cin>>n;
	for(int i=0;i<n;i++)
	{
		pro[i].p=i+1;
		cout<<"\nEnter the Burst Time of Process"<<i+1<<":";
		cin>>pro[i].bt;
	}
	sort();
	cout<<"\n\n-------------------------------------------------------------\n";
	cout<<"Process  |  Burst Time    |  TurnAroundTime  |  Witing Time |\n";
	cout<<"-------------------------------------------------------------\n";
	for(i=0;i<n;i++)
	{
		pro[i].wt=x;
		x+=pro[i].bt;
		pro[i].tat=x;
		twt+=pro[i].wt;
		ttat+=pro[i].tat;
		cout<<"   P"<<pro[i].p<<"\t | \t "<<pro[i].bt<<"\t   |   \t "<<pro[i].tat<<" \t    |\t   "<<pro[i].wt<<"\t     |\n";
	}
	cout<<"--------------------------------------------------------------";
	cout<<"\n\nTotal Turn Around Time = "<<ttat;
	cout<<"\nTotal Waiting Time = "<<twt;
	cout<<"\nAverage Turn Around Time = "<<ttat/n;
	cout<<"\nAverage Waiting Time = "<<twt/n;
	getch();
}
void sort()
{
	for(int i=0;i<n-1;i++)
	for(int j=i;j<n;j++)
		if(pro[i].bt>pro[j].bt)
		{
			struct process temp=pro[i];
			pro[i]=pro[j];
			pro[j]=temp;
		}
}
/*OUTPUT:
	::Program for SJF scheduling without Arrival Time::
-----------------------------------------------------------------------------------------------
Enter the no. of Processes:4
Enter the Burst Time of Process1:20
Enter the Burst Time of Process2:13
Enter the Burst Time of Process3:17
Enter the Burst Time of Process4:9
-----------------------------------------------------------------------------------------------
Process     |       Burst Time          |     TurnAroundTime |      Witing Time        |
-----------------------------------------------------------------------------------------------
   P4	 | 	 9	   |   	 9 	    |	   0	     |
   P2	 | 	 13	   |   	 22 	    |	   9	     |
   P3	 | 	 17	   |   	 39 	    |	   22	     |
   P1	 | 	 20	   |   	 59 	    |	   39	     |
----------------------------------------------------------------------------------------------
Total Turn Around Time = 129
Total Waiting Time = 70
Average Turn Around Time = 32
Average Waiting Time = 17*/