Algorithm--插入排序

#include "stdafx.h"
#include <iostream>

#define DATA_SIZE 14

void insertSort(int data[], int iDataSize)
{
	int iTemp = 0;
	int j = 0;
	for ( int i = 1; i < iDataSize; i++ )
	{
		if ( data[i] < data[i - 1] )
		{
			iTemp = data[i];

			for ( j = i - 1; data[j] > iTemp; j-- )
			{
				data[j + 1] = data[j];
			}

			data[j + 1] = iTemp;
		}
	}
}

void printResult(int data[], int iDataSize)
{
	printf("排序后的结果是：");
	for ( int i = 0; i < iDataSize; i++)
	{
		printf("%d ", data[i]);
	}
	printf("\n\n");
}

int _tmain(int argc, _TCHAR* argv[])
{
	int data[DATA_SIZE] = {3,6,1,4,2,5,9,33,8,1,22,32,11,18};
	insertSort(data, DATA_SIZE);
	printResult(data, DATA_SIZE);

	getchar();
	return 0;
}