//直接插入排序
#include <iostream>
using namespace std;
void InsertSort(int *pData, int Count)
{
int iTemp;
int iPos;
for (int i = 1; i < Count; i++)
{
iTemp = pData[i];
iPos = i -1;
while ((iPos >= 0) && (iTemp < pData[iPos]))
{
pData[iPos + 1] = pData[iPos];
iPos--;
}
pData[iPos + 1] = iTemp;
}
}
void main()
{
int data[] = {10, 4, 6, 7, 3};
InsertSort(data, 5);
for (int i = 0; i < 5; i++)
{
cout << data[i] << " ";
}
cout << "\n";
}
浙公网安备 33010602011771号