直接插入排序

1. 将剩余数据中的第一项插入到已排序数据中，直至全部数据遍历完成
   1. 传入参数为数组地址和数组长度
   2. 破坏性操作，原数组值已经改变

void IsertionSort(int a[], int len) {
	int i, j;
	int temp;
	for (i = 0; i < len; i++) {
		temp = a[i];
		for (j = i; j > 0 && temp < a[j - 1]; j--) {
			a[j] = a[j - 1];//往后挪动
		}
		a[j] = temp;
	}
}

2. 测试用例

void main(void) {
	int a[] = {3,2,5,6,1,4,6,22,-1,0,8,91,4,13,5,12,3,5,643,421,346,12,1231,4,123,4214,312,4,5,512,12,124,512,1,2,3,4,5,6,7,8,9,7};
	IsertionSort(a, sizeof(a) / sizeof(int));
	for (int i = 0; i < sizeof(a) / sizeof(int); i++) {
		cout << a[i] << " ";
	}
	cout << endl;
}