1-直接插入排序.c
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
void InsertSort(int *a, int length)
{
int i, j, tmp;
for (i = 1; i < length; i++)
{
tmp = a[i];
for (j = i - 1; j >= 0; j--)
{
if (tmp < a[j])
{
a[j + 1] = a[j];
}
else
{
break;
}
}
a[j + 1] = tmp;
}
}
int main()
{
int i;
//int array[10] = {9, 3, 4, 4, 6, 0, 1, 3, 8, 5};
int array[10000] = {
0};
srand(time(NULL));
for (i = 0; i < 10000; i++)
{
array[i] = rand() % 1000;
}
InsertSort(array, sizeof(array) / sizeof(array[0]));
for (i = 0; i < sizeof(array) / sizeof(array[0]); i++)
{
printf("%d ", array[i]);
}
printf("\n");
return 0;
}
2-希尔排序.c
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
void ShellSort(int *a, int length)
{
int i, j, tmp, h;
for (h = length / 2; h > 0; h /= 2)
{
for (i = h; i < length; i++)
{
tmp = a[i];
for (j = i - h; j >= 0; j -= h)
{
if (tmp < a[j])
{
a[j + h] = a[j];
}
else
{
break;
}
}
a[j + h] = tmp;
}
}
}
int main()
{
int i;
//int array[10] = {9, 3, 4, 4, 6, 0, 1, 3, 8, 5};
int array[10000] = {
0};
srand(time(NULL));
for (i = 0; i < 10000; i++)
{
array[i] = rand() % 1000;
}
ShellSort(array, sizeof(array) / sizeof(array[0]));
for (i = 0; i <