三种页面置换算法的C++模拟

 #include<iostream>
 using namespace std;
 int page[] = { ,,,,,,,,,,,,,,,,,,,,- };
 void FIFO();
 void OPT();
 void RLU();
 bool inArray(int* a, int n, int p);
 int main(void) {
     FIFO();
     OPT();
     RLU();
     system("pause");
 }
 void FIFO() {
     int temp[] = { -,-,- };
     int time[] = { ,, };
     int num = ;
     int error = ;
     cout << "FIFO:" << endl;
     while (page[num] != -) {
         if (inArray(temp, , page[num])) {
             std::cout << page[num] << ',';
             std::cout << endl;
         }
         else {
             error++;
             bool hasChanged = false;
             for (int i = ; i < ; i++) {
                 if (time[i] ==  && hasChanged == false) {
                     time[i] = ;
                     temp[i] = page[num];
                     hasChanged = true;
                 }
                 if (time[i] != ) {
                     time[i]--;
                 }
             }
             std::cout << page[num] << ',' << ' ';
             for (size_t i = ; i < ; i++) {
                 if (temp[i] == -) {
                     std::cout << '*' << ' ';
                 }
                 else {
                     std::cout << temp[i] << ' ';
                 }
             }
             std::cout << endl;
         }
         num++;
     }
     cout << "错误率:" << error << endl;
 }
 bool inArray(int* a, int n, int p) {
     for (int i = ; i < n; i++) {
         if (p == a[i]) {
             return true;
         }
     }
     return false;
 }
 void OPT() {
     int temp[] = { -,-,- };
     int num = ;
     int error = ;
     //OPT已知未来的页数为20
     cout << "OPT:" << endl;
     while (page[num] != -) {
         int a = page[num];
         if (inArray(temp, , page[num])) {
             std::cout << page[num] << ',';
             std::cout << endl;
         }
         else {
             error++;
             bool fuck = false;
             for (size_t i = ; i < ; i++){
                 if (temp[i] == -) {
                     temp[i] = page[num];
                     fuck = true;
                     break;
                 }
             }

             if (fuck == false) {
                 int distance[] = { ,, };
                 for (int i = ; i >= num; i--) {
                     for (int j = ; j < ; j++) {
                         if (temp[j] == page[i] && (i - num) < distance[j]) {
                             distance[j] = i - num;
                         }
                     }
                 }
                 int k = ;
                     int max = -;
                 for (size_t i = ; i < ; i++) {
                     if (max < distance[i]) {
                         max = distance[i];
                         k = i;
                     }
                 }
                 temp[k] = page[num];
             }
             std::cout << page[num] << ',' << ' ';
             for (size_t i = ; i < ; i++) {
                 if (temp[i] == -) {
                     std::cout << '*' << ' ';
                 }
                 else {
                     std::cout << temp[i] << ' ';
                 }
             }
             std::cout << endl;
         }
         num++;
     }
     cout << "错误率:" << error << endl;
 }
 void RLU(){
     int temp[] = { -,-,- };
     int time[] = { -,-,- };
     int num = ;
     int error = ;
     cout << "RLU:" << endl;
     while (page[num] != -) {
         int a = page[num];
         if (inArray(temp, , page[num])) {
             std::cout << page[num] << ',';
             std::cout << endl;
             //bool Changed = false;
             for (int i = ; i < ; i++) {
                 if (temp[i] == page[num]) {
                     time[i] = ;
                     //Changed = true;
                 }
                 if (temp[i] != page[num]&&time[i]!=) {
                     time[i]--;
                 }
             }
         }
         else {
             error++;
             //bool hasChange = false;
             for (size_t i = ; i < ; i++){
                 if (temp[i] == -) {
                     temp[i] = page[num];
                     time[i] = ;
                     break;
                 }
                 if(time[i] == ) {
                     temp[i] = page[num];
                     time[i] = ;
                 }
                 else {
                     time[i]--;
                 }
             }
             std::cout << page[num] << ',' << ' ';
             for (size_t i = ; i < ; i++) {
                 if (temp[i] == -) {
                     std::cout << '*' << ' ';
                 }
                 else {
                     std::cout << temp[i] << ' ';
                 }
             }
             std::cout << endl;
         }
         num++;
     }
     cout << "错误率:" << error << endl;
 }