#include <iostream>
using namespace std;
bool insertsort(int a[], int n)
{
if (n < 0)
{
cout << "please check your input:";
return false;
}
for (int i = 1; i < n; i++)
{
int t = a[i];
int j = i - 1;
for (; j >= 0; --j)
{
if (t < a[j])
a[j + 1] = a[j];
else
break;
}
a[j + 1] = t;
for (int k = 0; k < 11; k++)
cout << a[k] << " ";
cout << endl;
}
return true;
}
int main() {
cout << "K={11, 9, 20, 7,56, 9,42, 3, 7,15,16}的排序如下:\n" << endl;
int K[] = { 11,9,20,7,56,9,42,3,7,15,16 };
insertsort(K, 11);
cout << "\n最终排序结果为:\n "<<endl;
for (int i = 0; i < 11; i++)
cout << K[i] << " ";
return 0;
}