希尔排序

希尔排序

自己琢磨了大概两天的时间，去思考如何交换vector中的两个元素
由于资历尚浅，成品中swap函数是原来算法中自带的

// 希尔排序.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include <iostream>
#include <vector>
using namespace std;
void insert_sort(int stepLen, int *arr, int length);
void shell_sort(int stepLen, int *arr, int length);
int _tmain(int argc, _TCHAR* argv[])
{
	int arr[] = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
	int stepLen = sizeof(arr) / 8;
	int length = sizeof(arr) / 4;
	cout << "length = " << length << endl;
	shell_sort(stepLen, arr, length);
	
	

	getchar();
	return 0;
}
/*
	1.第一层循环控制步长，当步长为1时，就跳出
	2.第二层循环控制当前分组数
	3.第三层循环控制每个分组的长度
*/
void shell_sort(int stepLen, int *arr, int length){
	

	for (; stepLen != 0 ;){
		
		//可以得到每个小组的首地址
		insert_sort(stepLen, arr,length);
		stepLen /= 2;

	}
}

void insert_sort(int stepLen, int *arr, int length){
	vector<int> vec;
	for (int j = 0; j < stepLen; j++)
	{
		vector<int> vec;
		for (int i = j; i < length; i += stepLen){
			vec.push_back(arr[i]);
		}
		cout << "第" << j + 1 << "组:" << endl;

		cout << "vec:";
		for (int i = 0; i < vec.size(); i++){
			cout << vec[i] << " ";
		}

		int  mark = 0;
		for (int i = 0; i < vec.size(); i++){
			for (int k = i; k < vec.size(); k++){
				if (vec[mark] > vec[k]){
					mark = k;
				}
				if (k == (vec.size() - 1)){
					swap(vec[i], vec[mark]);
				}
			}
			if (i == (vec.size() - 1)){
				for (int x = 0; x < (vec.size() - 1); x++){
					for (int y = x; y < (vec.size() - 1); y++){
						if (vec[y] > vec[y + 1]){
							swap(vec[y], vec[y + 1]);
						}
					}
				}
			}
		}
		for (int i = j, k = 0; i < length; i += stepLen, k++){
			arr[i] = vec[k];
		}
		vec.clear();
		cout << endl;
		for (int i = 0; i < length; i++){
			cout << arr[i] << " ";
		}
		cout << endl;


		/*cout << "需要换的两个数：";
		cout << "vec[mark]:" << vec[mark] << "  ";
		cout << "vec[k]:" << vec[k] << "  ";
		cout << endl;
		*/
	}
}