Program for Next Fit algorithm in Memory Management

Prerequisite: Partition allocation methods
What is Next Fit ?
Next fit is a modified version of ‘first fit’. It begins as first fit to find a free partition but when called next time it starts searching from where it left off, not from the beginning. This policy makes use of a roving pointer. The pointer roves along the memory chain to search for a next fit. This helps in, to avoid the usage of memory always from the head (beginning) of the free block chain.

What are its advantage over first fit ?

  • First fit is a straight and fast algorithm, but tends to cut large portion of free parts into small pieces due to which, processes that needs large portion of memory block would not get anything even if the sum of all small pieces is greater than it required which is so called internal fragmentation problem.
  • Another problem of first fit is that it tends to allocate memory parts at the begining of the memory, which may leads to more internal fragements at the begining. Next fit tries to address this problem by starting search for the free portion of parts not from the start of the memory, but from where it ends last time.
  • Next fit is a very fast searching algorithm and is also comparatively faster than First Fit and Best Fit Memory Management Algorithms.
Input :  blockSize[] = {5, 10, 20};
     processSize[] = {10, 20, 30};
Process No.     Process Size    Block no.
 1              10              2
 2              20              3
 3              30              Not Allocated


  1. Input the number of memory blocks and their sizes and initializes all the blocks as free.
  2. Input the number of processes and their sizes.
  3. Start by picking each process and check if it can be assigned to current block, if yes, allocate it the required memory and check for next process but from the block where we left not from starting.
  4. If current block size is smaller then keep checking the further blocks.


// C/C++ program for next fit
// memory management algorithm
#include <bits/stdc++.h>
using namespace std;

// Function to allocate memory to blocks as per Next fit
// algorithm
void NextFit(int blockSize[], int m, int processSize[], int n)
    // Stores block id of the block allocated to a
    // process
    int allocation[n], j = 0;

    // Initially no block is assigned to any process
    memset(allocation, -1, sizeof(allocation));

    // pick each process and find suitable blocks
    // according to its size ad assign to it
    for (int i = 0; i < n; i++) {

        // Do not start from beginning
        while (j < m) {

            if (blockSize[j] >= processSize[i]) {

                // allocate block j to p[i] process
                allocation[i] = j;

                // Reduce available memory in this block.
                blockSize[j] -= processSize[i];


    cout << "\nProcess No.\tProcess Size\tBlock no.\n";
    for (int i = 0; i < n; i++) {
        cout << " " << i + 1 << "\t\t" << processSize[i] 
             << "\t\t";
        if (allocation[i] != -1)
            cout << allocation[i] + 1;
            cout << "Not Allocated";
        cout << endl;

// Driver program
int main()
    int blockSize[] = { 5, 10, 20 };
    int processSize[] = { 10, 20, 30 };
    int m = sizeof(blockSize) / sizeof(blockSize[0]);
    int n = sizeof(processSize) / sizeof(processSize[0]);

    NextFit(blockSize, m, processSize, n);

    return 0;


Process No.     Process Size    Block no.
 1              10              2
 2              20              3
 3              30              Not Allocated

This article is contributed by Akash Gupta. If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

GATE CS Corner    Company Wise Coding Practice

Recommended Posts:

Writing code in comment? Please use, generate link and share the link here.