round robin scheduling algorithm program in java

NIRAJ AHER

Founder of Java Engineering Programs. Follow me on Google+ ,Linked in.

You may also like...

2
Leave a Reply

avatar
2 Comment threads
0 Thread replies
0 Followers
 
Most reacted comment
Hottest comment thread
2 Comment authors
Mayurusman Recent comment authors
  Subscribe  
newest oldest most voted
Notify of
usman
Guest
usman

:-*

Mayur
Guest
Mayur

My Code , It is perfect according to logic but is giving different solution to the example above. import java.util.*; class Main { static int infinity=2147483647; static void sort(String names[],int at[],int st[],int p,int dat[],int dst[]) { int i,j,temp; String temp2; for(i=0;i<p;i++) { for(j=i+1;j at[j]) { temp=dat[i]; dat[i]=dat[j]; dat[j]=temp; temp=dst[i]; dst[i]=dst[j]; dst[j]=temp; temp=at[i]; at[i]=at[j]; at[j]=temp; temp=st[i]; st[i]=st[j]; st[j]=temp; temp2=names[i]; names[i]=names[j]; names[j]=temp2; } } } } static void finalsort(String names[],int dat[],int stt[],int ct[],int wt[],int tt[],int dst[],int p) { int i,j,temp; String temp2; for(i=0;i<p;i++) { for(j=i+1;j 0) { temp=dat[i]; dat[i]=dat[j]; dat[j]=temp; temp=stt[i]; stt[i]=stt[j]; stt[j]=temp; temp=ct[i]; ct[i]=ct[j]; ct[j]=temp; temp=wt[i]; wt[i]=wt[j]; wt[j]=temp; temp=tt[i]; tt[i]=tt[j]; tt[j]=temp;… Read more »