希尔排序

class Solution {
public:
   	//缩小增量的插入排序 -- 希尔排序
	void hillSort(vector<int> & v){
		for (int gap = v.size() / 2; gap > 0; gap/=2){
			for (int i = gap; i < v.size(); i++){
				for (int j = i; j > gap - 1; j -= gap){
					if (v[j] < v[j - gap]){
						int temp = v[j];
						v[j] = v[j - gap];
						v[j - gap] = temp;
					}
				}
			}
		}
	}	
};