//插入排序
#include<iostream>
using namespace std;
#define maxn 10
void Insertion_Sort(int arr[], int n)
{
for (int i = 1; i < n; ++i)
{
int j = i - 1;
int key = arr[i];
while (j >= 0 && key > arr[j])
{
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = key;
}
}
void PrintArr(int a[], int n)
{
for (int i = 0; i < n - 1; ++i)
{
cout << a[i] << " ";
}
cout << a[n - 1] << endl;
}
int main()
{
int a[maxn] = { 1,2,5,7,3,4,6,8,10,9 };
Insertion_Sort(a, maxn);
PrintArr(a, maxn);
return 0;
}