CA-LAB-program-programs to simulate memory allocation policies Best-fit algorithm

#include<iostream.h>
void main()
{
int mem[10],processes[10],n1,n2,flags[10],allocation[10]; 
int i,j,smallest;
for(i=0;i<10;i++)
{
flags[i]=0; allocation[i]=-1;
} 
cout<<"\nEnter No. of memory partitions:";
cin>>n1; 
cout<<"\nEnter size of each partition:";
for(i=0;i<n1;i++)
cin>>mem[i];
cout<,"\nenter size of each process:"; 
for(i=0;i<n2;i++) 
cin>>processes[i];
//allocation as per first fit
for(i=0;i<n2;i++)
{ 
smallest=-1; 
for(j=0;j<n1;j++)
if
(flags[j]==0 && mem[j]>=processes[i])
{smallest=j; break; 
}
for(j=0;j<n1;j++)
if(flags[j]==0 && mem[j]>=processes[i] && mem[j]<mem[smallest]) smallest=j;
if(smallest!=-1) 
{
allocation[smallest]=i; 
flags[smallest]=1;
}
}
//display allocation details 
cout<<"\nPartition size process no. size";
for(i=0;i<n1;i++)
{
cout<<"\n"<<i<<" "<<mem[i]<<" ";
if(flags[i]==1)
cout<<allocation[i]<<" "<<processes[allocation[i]];
else cout<<"------";
} 
}