ForNewbies/bestfit.cpp at main · amanss00/ForNewbies · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include<stdio.h>

int main()
{
int np,nb,min=1000,s;
printf("Enter number of processes:");
scanf("%d",&np);
int ap[np][2];
printf("Enter size of each process:\n");
for( int i=1;i<=np;i++)
{
printf("P[%d]:",i);
scanf("%d",&ap[i][0]);
ap[i][1]=0;
}
printf("Enter number of blocks:");
scanf("%d",&nb);
int ab[nb][3];
printf("Enter size of each block:\n");
for( int i=1;i<=nb;i++)
{
printf("B[%d]:",i);
scanf("%d",&ab[i][0]);
ab[i][1]=0;
ab[i][2]=0;
}
for (int i=1;i<=np;i++)
{

for(int j=1;j<=nb;j++)
{
  if(ap[i][0]<ab[j][0] && (ab[j][0]-ap[i][0])<min && ab[j][1]==0)
  {
    min=ab[j][0]-ap[i][0];
    s=j;
  }
}
  ab[s][1]=i;
  ab[s][2]=ap[i][0];
  ap[i][1]=1;
  min=1000;
}
printf("Block\tSize\tProcess\tSize\tStatus\n");
for(int i=1;i<=nb;i++)
{
printf("B[%d]\t%d\t%d\t%d\t",i,ab[i][0],ab[i][1],ab[i][2]);
if(ab[i][1]==0)
{
printf("Not Allocated\n");
}
else
{
printf("Allocated\n");
}
}
}