(2)--直接插入排序

#include <iostream>
using namespace std;
//直接插入排序
void insertSort(int *arr,int length)
{
for (int i = 1; i <= length - 1;i++) {//从第1个元素开始
//从第i个元素向前插入
for (int j = i; (j <= length - 1)&&(arr[j]<arr[j-1]);j--) {
int temp = arr[j];
arr[j] = arr[j - 1];
arr[j - 1] = temp;
}
}
}
int main()
{
int arr[10] = {8,7,9,1,5,6,3,2,4,0};
insertSort(arr,10);
for (int i = 0; i < 10;i++) {
cout << arr[i] << " ";
}
return 0;
}