#include<iostream>
using namespace std;
void Insert_Sort(int arr[], int length)
{
if (arr == nullptr || length <= 0)
return;
int j;
int temp;
for (int i = 1; i < length; ++i)
{
temp = arr[i];
for (j = i - 1; j >= 0; --j)
{
if (arr[j] <= temp)
break;
arr[j + 1] = arr[j];
}
arr[j + 1] = temp;
cout << "第" << i << "次交换:";
for (int i = 0; i < length; ++i)
cout << arr[i] << " ";
cout << endl;
}
}
int main(int argc, char* argv[])
{
const int length = 6;
int numbers[length] = { 20,56,42,3,7,16 };
Insert_Sort(numbers, length);
cout << "排序完成:";
for (int i = 0; i < length; i++)
cout << numbers[i] << " ";
cout << endl;
return 0;
}