best_fit_algo.cpp

#include <iostream>

using namespace std;

int main()
{
    int fragment[20], b[20], p[20], i, j, nb, np, temp, lowest = 9999;
    static int barray[20], parray[20];
    cout << "\n\t\t\tMemory Management Scheme - Best Fit";
    cout << "\nEnter the number of blocks: ";
    cin >> nb;
    cout << "Enter the number of processes: ";
    cin >> np;

    cout << "\nEnter the size of the blocks:-\n";
    for (i = 1; i <= nb; i++)
    {
        cout << "Block no." << i << ": ";
        cin >> b[i];
    }

    cout << "\nEnter the size of the processes :-\n";
    for (i = 1; i <= np; i++)
    {
        cout << "Process no. " << i << ": ";
        cin >> p[i];
    }

    for (i = 1; i <= np; i++)
    {
        for (j = 1; j <= nb; j++)
        {
            if (barray[j] != 1)
            {
                temp = b[j] - p[i];
                if (temp >= 0)
                    if (lowest > temp)
                    {
                        parray[i] = j;
                        lowest = temp;
                    }
            }
        }

        fragment[i] = lowest;
        barray[parray[i]] = 1;
        lowest = 10000;
    }

    cout << "\nProcess_no\tProcess_size\tBlock_no\tBlock_size\tFragment";
    for (i = 1; i <= np && parray[i] != 0; i++)
        cout << "\n"
             << i << "\t\t" << p[i] << "\t\t" << parray[i] << "\t\t" << b[parray[i]] << "\t\t" << fragment[i];

    return 0;
}