希尔排序

#include
using namespace std;
void swap(int* a,int* b)
{
	int temp=*a;
	*a=*b;
	*b=temp;
}
void main()

{
	int a[]={2,5,3,7,4,8,2,6,2,4,10};
	int length=sizeof(a)/sizeof(int);
	int gap=length/2;
	
	int i;
	int j;
	while(gap>=1)
	{
		for(i=0;i





gap&&a[temp]