LackNum++; flag=i; }
}
//模拟三种算法的页面置换过程, //给出每个页面访问时的内存分配情况 //每种算法的缺页次数和缺页率。 public static void output(){
LackPageRate=(double)LackNum/PageNum; for(i=0;i System.out.print(\ System.out.println(\ for(i=0;i System.out.print(PageOrder[i]+\ System.out.println(\ for(i=0;i System.out.print(\ System.out.println(\ for(j=0;j //for(i=0;i if(Simulate[i][j]==NULL) System.out.print(' '+\ else System.out.print(Simulate[i][j]+\ } System.out.println(\ } //cout< System.out.println(\缺页次数:\率:\ } } 缺页