标签：std arr cout int 插入排序 insertsort key
#include<iostream>
using namespace std;
void insertsort(int a[], int n)
{
int i, j, key;
for ( i = 1; i < n; i++)
{
if (a[i] < a[i - 1])
{
key = a[i];
for (j = i - 1; j>=0&&a[j]>key; j--)
a[j + 1] = a[j];
a[j + 1] = key;
}
}
}
int main()
{
int arr[6] = { 1,0,8,4,14,25 };
insertsort(arr, 6);
cout << "插入排序之后：" << endl;
for (int i = 0; i < 6; i++)
{
cout << arr[i] << " ";
}
return 0;
}
标签：std,
arr,
cout,
int,
插入排序,
insertsort,
key
From： https://blog.csdn.net/weixin_73598089/article/details/140513631