#include<iostream>
using namespace std;
void insert_sort(int arr[])
{
for (size_t i = 1; i < 10; i++)
{
int temp = arr[i];
int j = i - 1;
while (arr[j]>temp)
{
arr[j+1] = arr[j];
arr[j] = temp;
j--;
}
}
}
int main(int argc, char *argv[])
{
int arr[10] = { 0,1,2,3,4,6,7,8,9,5 };
insert_sort(arr);
for (size_t i = 0; i < 10; i++)
{
cout << arr[i] << " ";
}
system("pause");
return 0;
}
c++实现插序排序
最新推荐文章于 2022-09-03 03:18:53 发布