From f598faff498f7b9ffea0aea36e9c09aadb75ea87 Mon Sep 17 00:00:00 2001
From: Kshitij <kshitijk@tuta.io>
Date: Tue, 5 Nov 2024 00:21:16 +0530
Subject: [PATCH] Simplified and improved code B6. - Changed variable names and
 made prSize and blkSize global variables - Added note in main function

---
 Codes/Group B/Code-B6.cpp | 187 +++++++++++++++++---------------------
 1 file changed, 83 insertions(+), 104 deletions(-)

diff --git a/Codes/Group B/Code-B6.cpp b/Codes/Group B/Code-B6.cpp
index a047ffb..7e1e2db 100644
--- a/Codes/Group B/Code-B6.cpp	
+++ b/Codes/Group B/Code-B6.cpp	
@@ -1,117 +1,96 @@
-#include<iostream>
+#include <iostream>
 using namespace std;
 
-int blksize[] = {100, 500, 200, 300, 600};
+int blocks[] = {100, 500, 200, 300, 600};
 int processes[] = {212, 417, 112, 426};
+int blkSize = sizeof(blocks) / sizeof(blocks[0]);
+int prSize = sizeof(processes) / sizeof(processes[0]);
 
-void firstfit(int pr[], int pr_size, int blk[], int blk_size)
-{
-    for(int i = 0; i < pr_size; i++)
-    {
-        bool check = false;
-        for(int j = 0; j < blk_size; j++)
-        {
-            if((blk[j] - pr[i]) >= 0)
-            {
-                blk[j] = blk[j] - pr[i];
-                cout<<"\nProcess with value "<<pr[i]<<" allocated at block "<<j+1;
-                check = true;
-                break;
-            }
-        }
-        if(!check)
-        {
-            cout<<"\nProcess with value "<<pr[i]<<" not allocated";
-        }
+void FirstFit() {
+  cout<<endl<<"FIRST FIT:";
+  for (int i=0; i<prSize; i++) {
+      bool check = false;
+    for(int j=0; j<blkSize; j++) {
+      if ((blocks[j] - processes[i] >= 0)) {
+        blocks[j] -= processes[i];
+        check = true;
+        cout<<endl<<"Process "<<processes[i]<<" has been allocated to block "<<j+1;
+        break;
+      }
     }
-}
-
-void bestfit(int pr[], int pr_size, int blk[], int blk_size)
-{
-    for(int i = 0; i < pr_size; i++)
-    {
-        bool check = false;
-        int k, store = 999;
-        for(int j = 0; j < blk_size; j++)
-        {
-            if((blk[j] - pr[i]) >= 0 && (blk[j] - pr[i]) < store)
-            {
-                k = j + 1;
-                store = blk[j] - pr[i];
-                check = true;
-            }
-        }
-        if(!check)
-        {
-            cout<<"\nProcess with value "<<pr[i]<<" not allocated";
-        }
-        else{
-            blk[k - 1] = blk[k - 1] - pr[i];
-            cout<<"\nProcess with value "<<pr[i]<<" allocated at block "<<k;
-        }
+    if (check == false) {
+      cout<<endl<<"Process "<<processes[i]<<" has not been allocated.";
     }
+  }
 }
 
-void worstfit(int pr[], int pr_size, int blk[], int blk_size)
-{
-    for(int i = 0; i < pr_size; i++)
-    {
-        bool check = false;
-        int k, store = -1;
-        for(int j = 0; j < blk_size; j++)
-        {
-            if((blk[j] - pr[i]) >= 0 && (blk[j] - pr[i]) > store)
-            {
-                k = j + 1;
-                store = blk[j] - pr[i];
-                check = true;
-            }
-        }
-        if(!check)
-        {
-            cout<<"\nProcess with value "<<pr[i]<<" not allocated";
-        }
-        else{
-            blk[k - 1] = blk[k - 1] - pr[i];
-            cout<<"\nProcess with value "<<pr[i]<<" allocated at block "<<k;
-        }
+void NextFit() {
+  int j = 0;
+  cout<<endl<<"NEXT FIT:";
+  for (int i=0; i<prSize; i++) {
+    bool check = false;
+    for (int k=0; k<blkSize; k++) {
+      if ((blocks[j] - processes[i]) >= 0) {
+        blocks[j] = blocks[j] - processes[i];
+        cout<<endl<<"Process "<<processes[i]<<" has been allocated to block "<<j+1;
+        check = true;
+        break;
+      }
+      j = (j + 1) % blkSize;
     }
-}
-
-void nextfit(int pr[], int pr_size, int blk[], int blk_size)
-{
-    int j = 0;
-    for(int i = 0; i < pr_size; i++)
-    {
-        bool check = false;
-        for(int k = 0; k < blk_size; k++)
-        {
-            if((blk[j] - pr[i]) >= 0)
-            {
-                blk[j] = blk[j] - pr[i];
-                cout<<"\nProcess with value "<<pr[i]<<" allocated at block "<<j+1;
-                check = true;
-                break;
-            }
-            j = (j + 1) % blk_size;
-        }
-        if(!check)
-        {
-            cout<<"\nProcess with value "<<pr[i]<<" not allocated";
-        }
+    if (check == false) {
+      cout<<endl<<"Process "<<processes[i]<<" has not been allocated.";
     }
+  }
 }
 
-int main()
-{
-    int blk_size = sizeof(blksize)/sizeof(blksize[0]);
-    int pr_size = sizeof(processes)/sizeof(processes[0]);
-
-    ////Note: Use only one function at a time to get the correct output
-    
-    //firstfit(processes, pr_size, blksize, blk_size);
-    //bestfit(processes, pr_size, blksize, blk_size);
-    //worstfit(processes, pr_size, blksize, blk_size);
-    nextfit(processes, pr_size, blksize, blk_size);
-    return 0;
+void BestFit() {
+  for (int i=0; i<prSize; i++) {
+    bool check = false;
+    int k, store = 999;
+    for (int j=0; j<blkSize; j++) {
+      if ((blocks[j] - processes[i]) >= 0 && (blocks[j] - processes[i]) < store) {
+        k = j + 1;
+        store = blocks[j] - processes[i];
+        check = true;
+      }
+    }
+    if (check == false) {
+      cout<<endl<<"Process "<<processes[i]<<" was not allocated to any block.";
+    }
+    else {
+      blocks[k - 1] -= processes[i];
+      cout<<endl<<"Process "<<processes[i]<<" was allocated to block "<<k;
+    }
+  }
+}
+
+void WorstFit() {
+  bool check = false;
+  for (int i=0; i<prSize; i++) {
+    int k, store = -1;
+    for (int j=0; j<blkSize; j++) {
+      if ((blocks[j] - processes[i] >= 0 && (blocks[j] - processes[i] > store))) {
+        k = j + 1;
+        store = blocks[j] - processes[i];
+        check = true;
+      }
+    }
+    if (check == false) {
+      cout<<endl<<"Process "<<processes[i]<<" was not allocated to any block.";
+    }
+    else {
+    blocks[k - 1] -= processes[i];
+    cout<<endl<<"Process "<<processes[i]<<" was allocated to block "<<k;
+    }
+  }
+}
+
+int main () {
+  // ONLY RUN ONE FUNCTION AT A TIME.
+  // FirstFit();
+  // NextFit();
+  BestFit();
+  // WorstFit();
+  return 0;
 }