排序算法02：插入排序

插入排序（InsertionSort）時間複雜度O(N2)

#include "InsertionSort.h"
#include "Print.h"

// 插入排序算法
void InsertionSort(int A[], int N)
{
	int j, P;
	int Tmp;
	for(P = 1; P < N; P++) // 每增加一個新的數，就依次與前面的數比較，插入到前面已經排好序的數列中，相應的位置後移
	{
		Tmp = A[P];
		for(j = P; j > 0 && A[j-1] > Tmp; j--) // 每次循環保證前面P個都是排好序的
		{
			A[j] = A[j-1];
		}
		A[j] = Tmp;
		//printf("(%d, %d) ", P, j);
		//Print(A, N);
	}
}

主文件main.cpp

#include "InsertionSort.h"
#include "SelectionSort.h"
#include "ShellSort.h"
#include "MergeSort.h"
#include "HeapSort.h"
#include "Print.h"
#include <time.h>

#define N 10000

int main()
{
	int A[10] = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0};
	int B[N];
	FILE *fp = fopen("data.txt", "r");
	for(int i = 0; i < N; i++)
	{
		fscanf(fp, "%d", &B[i]);
	}
	
	clock_t start = clock();	// 計時開始

	// 插入排序Time = 327ms
	InsertionSort(B, N);

	// 選擇排序Time = 967ms
	// SelectionSort(B, 10000);

	// 希爾排序Time = 10ms
	//ShellSort(B, 10000);

	// 歸併排序Time = 27ms
	//MergeSort(B, N, 0, N - 1);

	// 堆排序Time = 4694ms
	//HeapSort(B, N);

	clock_t stop = clock();		// 計時結束
	
	//Print(B, N);
	
	printf("Time = %dms\n", (stop - start));
	//Print(B, N);

	return 0;
}

耗時Time = 327ms