fenzhifac.txt

常见算法

void Merge(int r[],int low ,int mid,int high)
{
	int *r1;
	int i=low,j=mid+1,k=0;
	r1=new int ;
	while(i<=mid && j<=high)
	{
		if(r[i]<=r[j])
		{
			r1[k]=r[i];
			i++;
			k++;
		}
		else
		{
			r1[k]=r[j];
			j++;
			k++;
		}
	}
	while(i<=mid)
	{
		r1[k]=r[i];
		i++;k++;
	}
	while(j<=high)
	{
		r1[k]=r[j];
		j++;k++;
	}
	for(k=0,i=low;i<=high;k++,i++)
	{
		r[i]=r1[k];
	}
}
void MergeSort(int r[],int low,int high)
{
	int mid;
	if(low<high)
	{
		mid=(low+high)/2;
		MergeSort(r,low,mid);
		MergeSort(r,mid+1,high);
		Merge(r,low,mid,high);
	}
}
#include<stdio.h>
#define size 8
main()
{
	int i;
	int r[size];
	printf("please enter the array\n");
	for(i=0;i<8;i++)
	{
		scanf("%d",&r[i]);
	}
    MergeSort(r,0,7);
    for(i=0;i<=7;i++)
    {
    	printf("%d ",r[i]);
    	}
	return 0;
}