排序之直接插入排序（C++）

直接排序就是将未排序部分的元素插入到已排序的元素列表中，代码实现：

Input number (q to quite): 9 6 4 1 3 9 4 6 8 7 3 1 6 4 5 9 4 q
Your input List is: 9 6 4 1 3 9 4 6 8 7 3 1 6 4 5 9 4
After sort: 1 1 3 3 4 4 4 4 5 6 6 6 7 8 9 9 9

#include<iostream>

using namespace std;

#define MAXSIZE 100

struct List
{
	int data[MAXSIZE];
	int size;
};

void swap(List &L, int i, int j)
{
	int temp = L.data[i];
	L.data[i] = L.data[j];
	L.data[j] = temp;
}

void show(const List &L)
{
	for (int i = 0; i < L.size; i++)
		cout << L.data[i] << " ";
	cout << endl;
}

void InsertSort(List &L)
{
	for (int i = 1; i < L.size; i++) {
		int temp = L.data[i];
		int j = i - 1;
		while (j >= 0 && temp < L.data[j]) {
			L.data[j + 1] = L.data[j];
			j--;
		}
		L.data[j + 1] = temp;
	}
}

void main()
{
	List test;
	cout << "Input number (q to quite): ";
	int temp;
	test.size = 0;
	while (test.size <= MAXSIZE&&cin >> temp) {
		test.data[test.size] = temp;
		test.size += 1;
		//cout << "Input number (q to quite): ";
	}
	cin.clear();
	cin.ignore(100, '\n');
	cout << "Your input List is: ";
	show(test);
	cout << "After sort: ";
	InsertSort(test);
	show(test);
}