直接插入排序

#include<iostream>
using namespace std;
void insertsort(int *p, int length)
{
int i=0, j=0;
for (i = 1; i < length; i++)
{
int temp = p[i];
for (j = i - 1; j >= 0 && p[j]>temp; j--)
{
p[j + 1] = p[j];
}
p[j + 1] = temp;
}
}
int main()
{
int p[] = { 2, 3, 7, 4, 5, 9 };
int length = 6;
insertsort(p,length);
for (int i = 0; i < length; i++)
{
cout << p[i] << " ";
}
}