c#中的拟合算法_C和C ++中的最佳拟合算法

「爱情、让人受尽委屈。」 2022-12-08 04:48 124阅读 0赞

![21b02f9eba9b35b043656f16c8ee9281.png][]

c\#中的拟合算法

Here you will learn about best fit algorithm in C and C++ with program example.

在这里，您将通过程序示例了解C和C ++中的最佳拟合算法。

Memory Management is one of the services provided by OS which is needed for Optimized memory usage of the available memory in a Computer System.

内存管理是操作系统提供的一项服务，对于优化计算机系统中可用内存的内存使用是必需的。

For this purpose OS uses 3 methods:-

为此，OS使用3种方法：

1.  [First Fit][]
    
    [首先适合][First Fit]
2.  Best Fit
    
    最合适
3.  Worst Fit
    
    最差的身材

In this section we will talk about Best Fit Memory Management Scheme.

在本节中，我们将讨论最佳适合内存管理方案。

### 什么是最佳适合内存管理方案？ **(**What is Best Fit Memory Management Scheme?**)** ###

Best fit uses the best memory block based on the Process memory request. In best fit implementation the algorithm first selects the smallest block which can adequately fulfill the memory request by the respective process.

最佳匹配根据进程内存请求使用最佳内存块。 在最佳拟合实现中，算法首先选择可以通过相应过程充分满足存储请求的最小块。

Because of this memory is utilized optimally but as it compares the blocks with the requested memory size it increases the time requirement and hence slower than other methods. It suffers from Internal Fragmentation which simply means that the memory block size is greater than the memory requested by the process, then the free space gets wasted.

由于此内存得到了最佳利用，但是在将块与请求的内存大小进行比较时，它增加了时间要求，因此比其他方法要慢。 它遭受内部碎片的困扰，这仅意味着内存块大小大于进程请求的内存，然后浪费了可用空间。

Once we encounter a process that requests a memory which is higher than block size we stop the algorithm.

一旦遇到请求内存大于块大小的进程，我们将停止算法。

### 最佳拟合算法 **(**Best Fit Algorithm**)** ###

1.  Get no. of Processes and no. of blocks.
    
    拿到 的过程，没有。 块。
2.  After that get the size of each block and process requests.
    
    之后，获取每个块的大小并处理请求。
3.  Then select the best memory block that can be allocated using the above definition.
    
    然后选择可以使用以上定义分配的最佳存储块。
4.  Display the processes with the blocks that are allocated to a respective process.
    
    显示带有分配给相应过程的块的过程。
5.  Value of Fragmentation is optional to display to keep track of wasted memory.
    
    显示碎片值是可选的，以便跟踪浪费的内存。
6.  Stop.
    
    停止。

## C中最佳拟合算法程序 **(**Program for Best Fit Algorithm in C**)** ##

#include<stdio.h>
     
    void main()
    {
    	int fragment[20],b[20],p[20],i,j,nb,np,temp,lowest=9999;
    	static int barray[20],parray[20];
    	
    	printf("\n\t\t\tMemory Management Scheme - Best Fit");
    	printf("\nEnter the number of blocks:");
    	scanf("%d",&nb);
    	printf("Enter the number of processes:");
    	scanf("%d",&np);
    	
    	printf("\nEnter the size of the blocks:-\n");
    	for(i=1;i<=nb;i++)
        {
    		printf("Block no.%d:",i);
            scanf("%d",&b[i]);
        }
    	
    	printf("\nEnter the size of the processes :-\n");
    	for(i=1;i<=np;i++)
        {
            printf("Process no.%d:",i);
            scanf("%d",&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;
    	}
    	
    	printf("\nProcess_no\tProcess_size\tBlock_no\tBlock_size\tFragment");
    	for(i=1;i<=np && parray[i]!=0;i++)
    		printf("\n%d\t\t%d\t\t%d\t\t%d\t\t%d",i,p[i],parray[i],b[parray[i]],fragment[i]);
    }

## C ++最佳拟合算法程序 **(**Program for Best Fit Algorithm in C++**)** ##

#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;
    }

**Output**

**输出量**

![Best Fit Algorithm in C and C++][Best Fit Algorithm in C and C]

Comment below if you have any doubts related to above best fit algorithm in C and C++.

如果您对以上C和C ++中的最佳匹配算法有任何疑问，请在下面评论。

> 翻译自: [https://www.thecrazyprogrammer.com/2017/01/best-fit-algorithm-c-c.html][https_www.thecrazyprogrammer.com_2017_01_best-fit-algorithm-c-c.html]

c\#中的拟合算法

[21b02f9eba9b35b043656f16c8ee9281.png]: /images/20221123/b1ef35bb96314f48ba7348ca4f8295e9.png
[First Fit]: https://www.thecrazyprogrammer.com/2017/01/first-fit-algorithm-in-c.html
[Best Fit Algorithm in C and C]: /images/20221123/c2e2c1c4cded440f9cb71e10dc0eb60e.png
[https_www.thecrazyprogrammer.com_2017_01_best-fit-algorithm-c-c.html]: https://www.thecrazyprogrammer.com/2017/01/best-fit-algorithm-c-c.html