3 数据结构课程设计个人任务3：希尔排序

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <sstream>
#include <stack>
#include <map>
#include <ctime>
#include <array>
#include <set>
using namespace std;
vector<int> departString_int(string data)
{
	vector<int> back_part;//output type
	int i, j;
	vector<string> part;
	string A_part;
	stringstream room;
	room.str(data);
	while (room >> A_part)
		part.push_back(A_part);
	for (i = 0; i < part.size(); i++)
	{
		int num_cahe;
		num_cahe = atoi(part[i].c_str());
		back_part.push_back(num_cahe);
	}
	return back_part;
}
vector<double> departString_double(string data)
{
	vector<double> back_part;//output type
	int i, j;
	vector<string> part;
	string A_part;
	stringstream room;
	room.str(data);
	while (room >> A_part)
		part.push_back(A_part);
	for (i = 0; i < part.size(); i++)
	{
		double num_cahe;
		num_cahe = atof(part[i].c_str());
		back_part.push_back(num_cahe);
	}
	return back_part;
}
vector<char> departString_char(string data)
{
	vector<char> back_part;//output type
	int i, j;
	vector<string> part;
	string A_part;
	stringstream room;
	room.str(data);
	while (room >> A_part)
		part.push_back(A_part);
	for (i = 0; i < part.size(); i++)
	{
		char num_cahe;
		num_cahe = part[i].at(0);
		back_part.push_back(num_cahe);
	}
	return back_part;
}
vector<string> departString_string(string data)
{
	vector<int> back_part;//output type
	int i, j;
	vector<string> part;
	string A_part;
	stringstream room;
	room.str(data);
	while (room >> A_part)
		part.push_back(A_part);
	return part;
}

//====================================================
template<class ElemType>
void ShellSort(vector<ElemType>& A, int dlta[], int t)
{
	int i, j, gap;
	int T;
	for (T = 0; T < t; T++)
	{
		gap = dlta[T];
		for (i = 0; i < gap; i++)
			for (j = i + gap; j < A.size(); j += gap)
				if (A[j] < A[j - gap])
				{
					ElemType temporary = A[j];
					int k = j - gap;
					while (k >= 0 && A[k] > temporary)
					{
						A[k + gap] = A[k];
						k -= gap;
					}
					A[k + gap] = temporary;
				}
		cout << gap << endl;
		for (i = 0; i < A.size() - 1; i++)
			cout << A[i] << " ";
		cout << A[i] << endl;
	}
}
int main()
{
	vector<int> input_int;
	vector<double> input_double;
	vector<char> input_char;
	vector<string> input_string;
	int kinds_num;
	int dlta[100], t;
	cin >> kinds_num;
	if (kinds_num != 0 && kinds_num != 1 && kinds_num != 2 && kinds_num != 3)
	{
		cout << "err" << endl;
		return 0;
	}
	cin.get();
	string s1;
	getline(cin, s1);
	if (kinds_num == 0)
		input_int = departString_int(s1);
	if (kinds_num == 1)
		input_double = departString_double(s1);
	if (kinds_num == 2)
		input_char = departString_char(s1);
	if (kinds_num == 3)
		input_string = departString_string(s1);

	cin >> t;
	for (int i = 0; i < t; i++)
		cin >> dlta[i];
	if (kinds_num == 0)
	{
		ShellSort(input_int, dlta, t);
	}
	if (kinds_num == 1)
	{
		ShellSort(input_double, dlta, t);
	}
	if (kinds_num == 2)
	{
		ShellSort(input_char, dlta, t);
	}
	if (kinds_num == 3)
	{
		ShellSort(input_string, dlta, t);
	}
	return 0;
}