asdf.cpp

几种排序算法：冒泡、直接插入、选择、She

#include<iostream.h>
void ShellSort(int R[],int n)
{
	int i,j,temp,d=n/2;
	while(d>0)
	{
		for(i=d;i<n;i++)
		{
			j=i-d;
			while(j>=0)
			{
				if(R[j]>R[i]){
					temp=R[j];
					R[j]=R[i];
					R[i]=temp;
				}
				else j=-1;
			}
		}
	d=d/2;
	}
}

void main()
{
	int R[10]={9,8,6,4,1,0,7,2,3,5};
	int n=10;
	ShellSort(R,n);
	for(int i=0;i<n;i++)
		cout<<R[i]<<' ';
	cout<<endl;
}