直接上代码
#include<iostream>
using namespace std;
const int SIZE = 10;
void sort(int* arr,int n);
void show(int* arr, int n);
int main()
{
int arr[SIZE] = {
0,4,5,2,4,6,4,8,9,1
};
sort(arr, SIZE);
show(arr, SIZE);
}
void sort(int* arr, int n)
{
for (int i = 1; i < n; i++)
{
int temp = arr[i];
int j = i - 1;
while (temp<arr[j]&&j>=0)
{
arr[j+1] = arr[j];
j--;
}
arr[j+1] = temp;
}
}
void show(int* arr, int n)
{
for (int i = 0; i < n; i++)
{
cout << arr[i] << " ";
}
}
运行结果
思路:前方有序,后续插入