插入排序有直接插入排序、折半插入排序、希尔排序等。
三种算法的比较:
代码实现:
void insertsort(int arr[], int size)//插入排序
{
int i, key = 0;
for (i = 1; i < size; i++)
{
key = arr[i];
int end = i - 1;
while (end >= 0 && key<arr[end])
{
arr[end+1] = arr[end];
end--;
}
arr[end + 1] = key;
}
}
void halfinsertsort(int arr[], int size)//折半插入排序
{
int i, j, left, right, x = 0, key = 0;
for (i = 1; i < size; i++)
{
left = 0;
right = i - 1;
key = arr[i];
while (left <= right)//在已经排好序的序列中找到合适的位置
{
x = (left + right) / 2;
if (key > arr[x])
left = x + 1;
else
right = x - 1;
}
for (j = i - 1; j >= right + 1; j--)
{
arr[j + 1] = arr[j];
}
arr[j + 1] = key;
}
}
void shellsort(int arr[], int size)//希尔排序
{
int i, key = 0;
int gap = 3;
while (gap > 0)
{
for (i = gap; i < size; i++)
{
key = arr[i];
int end = i - gap;
while (end >= 0 && key < arr[end])
{
arr[end + gap] = arr[end];
end -= gap;
}
arr[end + gap] = key;
}
gap--;//gap的取法有很多种情况
}
}