直接插入排序

#include<iostream>
using namespace std;
#define NUM 10

void DirectInsert(int *list,int n)
{
int i;
int j;
int x;

for (i=1;i<n;i++)
{
x = list[i];
for (j=i-1;j>=0;j--)
{
if (list[j]>x)
{
list[j+1] = list[j];
}
else
break;
}
list[j+1] = x;
}
}

void Print(int *list,int n)
{
int i;
for (i=0;i<5;i++)
{
cout << list[i] << ",";
}
cout << endl;
}

int main()
{
int arr[NUM];
int i;

srand(1); //初始化随机数发生器
for(i=0;i<NUM;i++)
{
arr[i]=rand()%100;//随机数在0到99范围内
}
cout << "before sorting :" << endl;
Print(arr,sizeof(arr)/sizeof(int));
DirectInsert(arr,sizeof(arr)/sizeof(int));
cout << "after sorting :" << endl;
Print(arr,sizeof(arr)/sizeof(int));

return 0;
}