#include <iostream>
using namespace std;
const int K = 11;
void insertSort(int arr[], int length) {
for (int i = 1; i < length; i++) {
int temp = arr[i];
int j = i - 1;
while (j >= 0 && arr[j] > temp) {
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = temp;
}
}
int main(int argc, const char* argv[]) {
int i, n, arr[K];
cout << "请输入要排序的数的个数:";
cin >> n;
cout << "请输入要排序的数:";
for (i = 0; i < n; i++)
cin >> arr[i];
cout << "排序前:" << endl;
for (i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
insertSort(arr, n);
cout << "排序后:" << endl;
for (i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
return 0;
}