#include <iostream>
using namespace std;
void insert_sort(int array[], int ncount)
{
for (int i = 1; i < ncount; i++)
{
int pivot = array[i];
int j;
for (j = i - 1; j >= 0; j--)
{
if (pivot < array[j])
{
array[j + 1] = array[j]; //往右挪
}
else
{
break;
}
}
array[j+1] = pivot; //插入
}
}
int main(int argc, char **argv)
{
int na[] = { 5, 1, 9, 2, 3, 7, 4, 0, 145,45,44,43,32,21 };
insert_sort(na, sizeof(na) / 4);
for (int i = 0; i < sizeof(na) / 4; i++)
{
cout << na[i] << endl;
}
return 0;
}
using namespace std;
void insert_sort(int array[], int ncount)
{
for (int i = 1; i < ncount; i++)
{
int pivot = array[i];
int j;
for (j = i - 1; j >= 0; j--)
{
if (pivot < array[j])
{
array[j + 1] = array[j]; //往右挪
}
else
{
break;
}
}
array[j+1] = pivot; //插入
}
}
int main(int argc, char **argv)
{
int na[] = { 5, 1, 9, 2, 3, 7, 4, 0, 145,45,44,43,32,21 };
insert_sort(na, sizeof(na) / 4);
for (int i = 0; i < sizeof(na) / 4; i++)
{
cout << na[i] << endl;
}
return 0;
}