Write a program for the simulation of the following file allocation strategies b)Indexed c)Linked code example

Example: Write a program for the simulation of the following file allocation strategies a)Sequential b)Indexed c)Linked

/* Program to simulate sequential file allocation strategy */
#include <iostream>
#include <conio.h>
using namespace std;

void recurse(int files[]){
    int flag = 0, startBlock, len, k;
    cout << "Enter the starting block and the length of the files: ";
    cin >> startBlock >> len;
    for (int j=startBlock; j<(startBlock+len); j++){
        if (files[j] == 0)
            flag++;
    }
    if(len == flag){
        for (int k=startBlock; k<(startBlock+len); k++){
            if (files[k] == 0){
                files[k] = 1;
                cout << k <<"\t" << files[k] << endl;
            }
        }
        if (k != (startBlock+len-1))
            cout << "The file is allocated to the disk" << endl;
    }
    else
        cout << "The file is not allocated to the disk" << endl;

    cout << "Do you want to enter more files?" << endl;
    int ch;
    cout << "Press 1 for YES, 0 for NO: ";
    cin >> ch;
    if (ch == 1)
        recurse(files);
    else
        exit(0);
    return;
}

int main()
{
int files[50];
for(int i=0;i<50;i++)
files[i]=0;
cout << "Files Allocated are :" << endl;

recurse(files);
getch();
return 0;
}