各排序算法的比较
下面以图示作为说明
排序说明
默认排序均排序成升序序列,使用 int 类型数组
插入式排序
插入排序
#include <stdio.h>
#define MAX_SIZE 20
typedef int Type;
void printArr(Type arr[], int length)
{
int i;
for (i = 0; i < length; i++)
{
printf("%d ", arr[i]);
}
printf("\n");
}
void insertSort(Type arr[], int length)
{
int i, j, index;
Type temp;
for (i = 0; i < length; i++)
{
temp = arr[i];
index = i;
for (j = i - 1; j >= 0; j--)
{
if (temp < arr[j])
{
index = j;
}
else
{
break;
}
}
if (index != i)
{
for (j = i - 1; j >= index; j--)
{
arr[j + 1] = arr[j];
}
arr[index] = temp;
}
printArr(arr, length);
}
}
int main()
{
Type arr[] = { 1, 3, 5, 7, 9, 2, 4, 6, 8, 10 };
int length = sizeof(arr) / sizeof(Type);
insertSort(arr, length);
}
二分插入排序
#include <stdio.h>
#define MAX_SIZE 20
typedef int Type;
void printArr(Type arr[], int length)
{
int i;
for (i = 0; i < length; i++)
{
printf("%d ", arr[i]);
}
printf("\n");
}
void halfInsertSort(Type arr[], int length)
{
int i, j;
int left, right, mid;
Type temp;
for (i = 0; i < length; i++)
{
temp = arr[i];
left = 0;
right = i - 1;
while (left <= right)
{
mid = (left + right) / 2;
if (arr[mid] < temp)
{
left = mid + 1;
}
else
{
right = mid - 1;
}
}
mid = right + 1;
for (j = i - 1; j >= mid; j--)
{
arr[j + 1] = arr[j];
}
arr[mid] = temp;
printArr(arr, length);
}
}
int main()
{
Type arr[] = { 1, 3, 5, 7, 9, 2, 4, 6, 8, 10 };
int length = sizeof(arr) / sizeof(Type);
halfInsertSort(arr, length);
}
希尔排序
采用 2 ^ k-1 作为间隔
#include <stdio.h>
#define MAX_SIZE 20
typedef int Type;
void printArr(Type arr[], int length)
{
int i;
for (i = 0; i < length; i++)
{
printf("%d ", arr[i]);
}
printf("\n");
}
void shellInsert(Type arr[], int length, int step)
{
int i, j, index;
Type temp;
for (i = 0; i < length; i++)
{
temp = arr[i];
index = i;
for (j = i - 1; j >= 0; j -= step)
{
if (temp < arr[j])
{
index = j;
}
else
{
break;
}
}
if (index != i)
{
for (j = i - 1; j >= index; j -= step)
{
arr[j + step] = arr[j];
}
arr[index] = temp;
}
}
}
void shellSort(Type arr[], int step[], int arrLength, int stepLength)
{
int i;
for (i = 0; i < stepLength; i++)
{
shellInsert(arr, arrLength, step[i]);
}
printArr(arr, arrLength);
}
int getSize(int length)
{
int start = 2;
int count = 0;
while (start < length)
{
start *= 2;
count++;
}
return count;
}
void generateStep(int step[], int stepLength)
{
int start = 1;
int i;
for (i = 0; i < stepLength; i++)
{
start *= 2;
step[i] = start - 1;
}
}
int main()
{
Type arr[] = { 1, 3, 5, 7, 9, 2, 4, 6, 8, 10 };
int length = sizeof(arr) / sizeof(Type);
int stepLength = getSize(length);
int step[stepLength];
generateStep(step, stepLength);
shellSort(arr, step, length, stepLength);
}
交换式排序
冒泡排序
经典版本
#include <stdio.h>
#define MAX_SIZE 20
typedef int Type;
void printArr(Type arr[], int length)
{
int i;
for (i = 0; i < length; i++)
{
printf("%d ", arr[i]);
}
printf("\n");
}
void bubbleSort(Type arr[], int length)
{
int i, j;
Type temp;
for (i = 0; i < length; i++)
{
for (j = 0; j < length - i - 1; j++)
{
if (arr[j] > arr[j + 1])
{
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
printArr(arr, length);
}
}
int main()
{
Type arr[] = { 1, 3, 5, 7, 9, 2, 4, 6, 8, 10 };
int length = sizeof(arr) / sizeof(Type);
bubbleSort(arr, length);
}
冒泡排序可以稍微改进一下,增加一个 flag 标志,标识在某一趟就已经排好序了,后面就不用再排序
#include <stdio.h>
#define MAX_SIZE 20
typedef int Type;
void printArr(Type arr[], int length)
{
int i;
for (i = 0; i < length; i++)
{
printf("%d ", arr[i]);
}
printf("\n");
}
void bubbleSort(Type arr[], int length)
{
int i, j;
int flag = 1;
Type temp;
for (i = 0; i < length; i++)
{
flag = 0;
for (j = 0; j < length - i - 1; j++)
{
if (arr[j] > arr[j + 1])
{
flag = 1;
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
printArr(arr, length);
if (flag == 0)
{
break;
}
}
}
int main()
{
Type arr[] = { 1, 3, 5, 7, 9, 2, 4, 6, 8, 10 };
int length = sizeof(arr) / sizeof(Type);
bubbleSort(arr, length);
}
快速排序
哨兵模式的经典版本,采用递归实现
#include <stdio.h>
#define MAX_SIZE 20
typedef int Type;
void printArr(Type arr[], int length)
{
int i;
for (i = 0; i < length; i++)
{
printf("%d ", arr[i]);
}
printf("\n");
}
int Partition(Type arr[], int low, int high)
{
Type temp = arr[low];
Type pivot = arr[low];
while (low < high)
{
while (low < high && arr[high] >= pivot)
{
high--;
}
arr[low] = arr[high];
while (low < high && arr[low] <= pivot)
{
low++;
}
arr[high] = arr[low];
}
arr[low] = temp;
return low;
}
void quickSort(Type arr[], int low, int high, int length)
{
if (low < high)
{
int pivot = Partition(arr, low, high);
quickSort(arr, low, pivot - 1, length);
quickSort(arr, pivot + 1, high, length);
}
printArr(arr, length);
}
int main()
{
Type arr[] = { 5, 3, 1, 7, 9, 2, 4, 6, 8, 10 };
int length = sizeof(arr) / sizeof(Type);
quickSort(arr, 0, length - 1, length);
}
采用辅助数组实现(相对哨兵模式会复杂一些,但并不难理解)
#include <stdio.h>
#define MAX_SIZE 20
typedef int Type;
void printArr(Type arr[], int length)
{
int i;
for (i = 0; i < length; i++)
{
printf("%d ", arr[i]);
}
printf("\n");
}
int Partition(Type arr[], Type temp[], int low, int high)
{
Type pivot = arr[low];
int index = low + 1;
while (low < high)
{
if (arr[index] > pivot)
{
temp[high--] = arr[index++];
}
else
{
temp[low++] = arr[index++];
}
}
temp[low] = pivot;
printArr(temp, 10);
return low;
}
void quickSort(Type arr[], Type temp[], int low, int high, int length)
{
if (low < high)
{
int pivot = Partition(arr, temp, low, high);
int i;
for (i = low; i < pivot; i++)
{
arr[i] = temp[i];
}
quickSort(arr, temp, low, pivot - 1, length);
for (i = pivot + 1; i <= high; i++)
{
arr[i] = temp[i];
}
quickSort(arr, temp, pivot + 1, high, length);
}
}
int main()
{
Type arr[] = { 5, 3, 1, 7, 9, 2, 4, 6, 8, 10 };
int length = sizeof(arr) / sizeof(Type);
Type temp[length] = { };
quickSort(arr, temp, 0, length - 1, length);
}
选择式排序
选择排序
简单的选取然后交换
#include <stdio.h>
#define MAX_SIZE 20
typedef int Type;
void printArr(Type arr[], int length)
{
int i;
for (i = 0; i < length; i++)
{
printf("%d ", arr[i]);
}
printf("\n");
}
void selectSort(Type arr[], int length)
{
int i, j;
int index;
Type temp;
for (i = 0; i < length; i++)
{
index = i;
for (j = i + 1; j < length; j++)
{
if (arr[j] < arr[index])
{
index = j;
}
}
if (index != i)
{
temp = arr[i];
arr[i] = arr[index];
arr[index] = temp;
}
printArr(arr, length);
}
}
int main()
{
Type arr[] = { 1, 3, 5, 7, 9, 2, 4, 6, 8, 10 };
int length = sizeof(arr) / sizeof(Type);
selectSort(arr, length);
}
堆排序
堆排序是利用大根堆或者小根堆实现的排序,在这个排序里面要解决两个问题,如何建立一个堆,以及如何对堆进行调整
需要注意的是,堆排序比较在意下标的变化,在 建堆 和 堆调整时,如果下标都采用 i < high 则没问题,但如果是采用 i <= high ,则会在建堆的时候出现小问题,而且只对小根堆出现问题,大根堆不会出现问题
下面是采用 大根堆 进行的升序排序
#include <stdio.h>
#define MAX_SIZE 20
typedef int Type;
void printArr(Type arr[], int length)
{
int i;
for (i = 0; i < length; i++)
{
printf("%d ", arr[i]);
}
printf("\n");
}
void heapAdjust(Type arr[], int low, int high)
{
Type temp = arr[low];
int i;
for (i = 2 * low; i < high; i *= 2)
{
if (i < high && arr[i] < arr[i + 1])
{
i++;
}
if (temp >= arr[i])
{
break;
}
arr[low] = arr[i];
low = i;
}
arr[low] = temp;
}
void createHeap(Type arr[], int length)
{
int i;
for (i = length / 2; i >= 0; i--)
{
heapAdjust(arr, i, length);
}
}
void heapSort(Type arr[], int length)
{
createHeap(arr, length);
int i;
Type temp;
for (i = length - 1; i > 0; i--)
{
temp = arr[0];
arr[0] = arr[i];
arr[i] = temp;
heapAdjust(arr, 0, i - 1);
printArr(arr, length);
}
}
int main()
{
Type arr[] = { 1, 1, 1, 3, 5, 7, 9, 2, 4, 6, 8, 10 };
int length = sizeof(arr) / sizeof(Type);
heapSort(arr, length);
}
下面是采用小根堆建立的降序排序
#include <stdio.h>
#define MAX_SIZE 20
typedef int Type;
void printArr(Type arr[], int length)
{
int i;
for (i = 0; i < length; i++)
{
printf("%d ", arr[i]);
}
printf("\n");
}
void heapAdjust(Type arr[], int low, int high)
{
Type temp = arr[low];
int i;
for (i = 2 * low; i < high; i *= 2)
{
if (i < high && arr[i] > arr[i + 1])
{
i++;
}
if (temp <= arr[i])
{
break;
}
arr[low] = arr[i];
low = i;
}
arr[low] = temp;
}
void createHeap(Type arr[], int length)
{
int i;
for (i = length / 2; i >= 0; i--)
{
heapAdjust(arr, i, length);
}
}
void heapSort(Type arr[], int length)
{
createHeap(arr, length);
int i;
Type temp;
for (i = length - 1; i > 0; i--)
{
temp = arr[0];
arr[0] = arr[i];
arr[i] = temp;
heapAdjust(arr, 0, i - 1);
printArr(arr, length);
}
}
int main()
{
Type arr[] = { 1, 1, 1, 3, 5, 7, 9, 2, 4, 6, 8, 10 };
int length = sizeof(arr) / sizeof(Type);
heapSort(arr, length);
}
归并排序
这里采用经典的递归实现,左划分,右划分,然后合并
# include <stdio.h>
#define MAX_SIZE 20
typedef int Type;
void printArr(Type arr[], int length)
{
int i;
for (i = 0; i < length; i++)
{
printf("%d ", arr[i]);
}
printf("\n");
}
void merge(Type arr[], Type temp[], int start, int mid, int end)
{
int k = 0;
int i = start;
int j = mid + 1;
while (i <= mid && j <= end)
{
if (arr[i] <= arr[j])
{
temp[k++] = arr[i++];
}
else
{
temp[k++] = arr[j++];
}
}
if (i == mid + 1)
{
while (j <= end)
{
temp[k++] = arr[j++];
}
}
if (j == end + 1)
{
while (i <= mid)
{
temp[k++] = arr[i++];
}
}
for (i = 0, j = start; i < k; i++, j++)
{
arr[j] = temp[i];
}
printArr(arr, end + 1);
}
void mergeSort(Type arr[], Type temp[], int start, int end)
{
if (start >= end)
{
return;
}
int mid = (start + end) / 2;
mergeSort(arr, temp, start, mid);
mergeSort(arr, temp, mid + 1, end);
merge(arr, temp, start, mid, end);
}
int main()
{
Type arr[] = { 1, 3, 5, 7, 9, 2, 4, 6, 8, 10, 1, 1 };
int length = sizeof(arr) / sizeof(Type);
Type temp[length] = { };
mergeSort(arr, temp, 0, length - 1);
printArr(arr, length);
}
基数排序
不同于前面的比较式排序,这里采用桶思想,每次放入对应桶,从低位到高位,放入取出结束后,序列就有序了
#include <stdio.h>
#include <string.h>
#define MAX_SIZE 20
typedef int Type;
void printArr(Type arr[], int length)
{
int i;
for (i = 0; i < length; i++)
{
printf("%d ", arr[i]);
}
printf("\n");
}
int getmaxLength(Type arr[], int length)
{
int i;
int max = 0;
int count;
Type temp;
for (i = 0; i < length; i++)
{
count = 0;
temp = arr[i];
while (temp >= 1)
{
temp /= 10;
count++;
}
if (count > max)
{
max = count;
}
}
return max;
}
int getDigit(Type num, int i)
{
while (i > 1)
{
num /= 10;
i--;
}
return num % 10;
}
void radixSort(Type arr[], int length, int maxLength)
{
int i, j, k, l, digit;
Type temp[10][length] ;
memset(temp, 0, sizeof(temp));
for (i = 1; i <= maxLength; i++)
{
for (j = 0; j < length; j++)
{
digit = getDigit(arr[j], i);
k = 0;
while (temp[digit][k])
{
k++;
}
temp[digit][k] = arr[j];
}
l = 0;
for (j = 0; j < 10; j++)
{
k = 0;
while (temp[j][k])
{
arr[l++] = temp[j][k++];
}
}
memset(temp, 0, sizeof(temp));
printArr(arr, length);
}
}
int main()
{
Type arr[] = { 1, 3, 5, 7, 9, 2, 4, 6, 8, 10, 101, 1001 };
int length = sizeof(arr) / sizeof(Type);
int maxLength = getmaxLength(arr, length);
radixSort(arr, length, maxLength);
}
附注
以上实现为经典规范方式,较容易理解与实现;对于快速排序、归并排序也是可以通过迭代而不是递归实现。
以及这里采用的是数组即线性表的方式,而不是链表,如果是链表,对于归并排序的复杂度可以降低