编辑代码

#include <iostream>
using namespace std;    //插入排序

void insertion_sort(int a[], int n) {
	for (int i = 1; i < n; i++) {
		for (int j = i; j >= 1; j--) {
			if (a[j] < a[j - 1]) {
				int tmp = a[j];
				a[j] = a[j - 1];
				a[j - 1] = tmp;
			} else
				break;
		}
	}

}

int main() {
	int n[] = { 11, 9, 20, 7, 56, 9, 42, 3, 7, 15, 16 };
	int length = sizeof(n) / sizeof(n[0]);
	insertion_sort(n, length);
	for (int i = 0; i < length; i++) {
		cout << n[i] << ' ';
	}
	cout << endl;

	return 0;
}