shell sort.cpp

经典算法实现

#include "Sort.h"

void insert(int beg,int increment,int len){

	for(int i=increment;i<len;i +=increment){
			
		for (int j=i;j>0 && arr[j+beg]<arr[j+beg-increment];j-=increment)	{
						swap(arr[j+beg],arr[beg+j-increment]);	
		}

	}
}

void shellSort(){
	//insert(1,num);

	int dis = num/2;
	for (;dis>0;dis /=2)
	{
		for (int i=0;i<dis;i++)
		{
			insert(i,dis,num);
		}
	}

}