插入排序:
void insertSort(int array[], int n)
{
int temp = 0;
int j = 0;
for (int i = 1; i < n; i++)
{
if (array[i] < array[i - 1])//当前值小于有序序列的最大值
{
temp = array[i];
for (j = i - 1; temp < array[j]; j--)//检索当前值合适的插入位置,并进行移动
{
array[j + 1] = array[j];
}
array[j + 1] = temp;
}
}
}
希尔排序:
void sheelSort(int array[], int len)
{
int gap = 0;
int m = 0, i = 0, j = 0;
for (gap = len / 2; gap > 0; gap /= 2)//步长gap
{
for (i = 0; i < gap; i++) //分为gap个组
{
for (j = i + gap; j < len; j += gap)//每组分别进行插入排序
{
if (array[j] < array[j - gap])
{
int temp = array[j];
//寻找插入位置
for (m = j - gap; array[m] > temp && m >= 0; m -= gap)
{
array[m + gap] = array[m];
}
array[m + gap] = temp;
}
}
}
}
}
快速排序:
void quickSort(int array[], int left, int right)
{
if (left >= right)
{
return;
}
int base = array[left];//base设置为最左边的点
int leftIndex = left;
int rightIndex = right;
while (leftIndex < rightIndex)//左右游标依次遍历
{
//自右向左寻找第一个小于base的值
while (leftIndex < rightIndex && array[rightIndex] >= base)
{
rightIndex--;
}
//自左向右寻找第一个大于base的值
while (leftIndex < rightIndex && array[leftIndex] <= base)//
{
leftIndex++;
}
//交换这两个值的位置
if (leftIndex < rightIndex)//
{
int temp = array[leftIndex];
array[leftIndex] = array[rightIndex];
array[rightIndex] = temp;
}
}
//将左游标指向的值与base交换,将base置于中间
array[left] = array[leftIndex];
array[leftIndex] = base;
//基于分治法进行递归
quickSort(array, left, rightIndex - 1);
quickSort(array, rightIndex + 1, right);
}