#include <iostream>
#include <stdlib.h>
using namespace std;
void insertSort(int arr[], int len)
{
//int len = sizeof(arr)/sizeof(arr[0]);//传入函数的数组是一个指针,不能获取其length
if (len<=0)
return;
for (int i = 1; i < len; i++ )
{
int key = arr[i];
int j = i-1;
while (j>=0 && arr[j]>key)//arr[j]<key改为降序
{
arr[j+1] = arr[j];
j = j-1;
}
arr[j+1] = key;
}
}
int main()
{
int arr[] = {1, 3, 2, 9, 6, 4};
int len = sizeof(arr)/sizeof(arr[0]);
insertSort(arr, len);
for (int i=0; i<len; i++)
{
cout<<arr[i]<<" ";
}
return 0;
}
*************************************************************
输出结果:1 2 3 4 6 9
*************************************************************