排序算法性能比较
在Java语言下进行测试,分别测试 1 000、10 000、100000、100 0000、1000 0000 数据下的排序所需性能
平方级的算法对比
直接插入、二分插入、冒泡、选择
nlogn级别的:希尔排序、快速排序、堆排序、归并排序
N级别的基数排序
排序说明
默认排序均排序成升序序列,使用 int 类型数组
测试主程序
package sort;
/**
* @author bbyh
* @date 2022/11/19 0019 17:12
* @description
*/
public class PerformanceTest {
private static final int LENGTH = 50;
public static void main(String[] args) {
int[] arr = new int[LENGTH];
for (int i = 0; i < LENGTH; i++) {
arr[i] = (int) (Math.random() * LENGTH);
}
long start = System.currentTimeMillis();
RadixSort.radixSort(arr, arr.length);
long end = System.currentTimeMillis();
System.out.println(end - start);
printArr(arr);
}
public static void printArr(int[] arr) {
for (int num : arr) {
System.out.print(num + " ");
}
}
}
插入式排序
插入排序
package sort;
/**
* @author bbyh
* @date 2022/11/19 0019 17:11
* @description
*/
public class InsertSort {
public static void insertSort(int[] arr, int length) {
int i, j, index;
int 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;
}
}
}
}
二分插入排序
package sort;
/**
* @author bbyh
* @date 2022/11/19 0019 18:21
* @description
*/
public class HalfInsertSort {
public static void halfInsertSort(int[] arr, int length) {
int i, j;
int left, right, mid;
int 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;
}
}
}
希尔排序
采用 3 ^ k + 1 作为间隔
package sort;
/**
* @author bbyh
* @date 2022/11/19 0019 18:23
* @description
*/
public class ShellSort {
private static final int NUM = 3;
public static void shellSort(int[] arr, int length) {
int gap = 1, i, j;
int temp;
while (gap < length / NUM) {
gap = gap * 3 + 1;
}
for (; gap > 0; gap /= NUM) {
for (i = gap; i < length; i++) {
temp = arr[i];
for (j = i - gap; j >= 0 && arr[j] > temp; j -= gap) {
arr[j + gap] = arr[j];
}
arr[j + gap] = temp;
}
}
}
}
交换式排序
冒泡排序
经典版本 与 优化版本:冒泡排序可以稍微改进一下,增加一个 flag 标志,标识在某一趟就已经排好序了,后面就不用再排序
package sort;
/**
* @author bbyh
* @date 2022/11/19 0019 18:29
* @description
*/
public class BubbleSort {
public static void bubbleSort(int[] arr, int length) {
int i, j;
int 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;
}
}
}
}
public static void bubbleSortImprove(int[] arr, int length) {
int i, j;
int flag;
int 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;
}
}
if (flag == 0) {
break;
}
}
}
}
快速排序
哨兵模式的经典版本,采用递归实现; 采用辅助数组实现(相对哨兵模式会复杂一些,但并不难理解)
package sort;
/**
* @author bbyh
* @date 2022/11/19 0019 18:31
* @description
*/
public class QuickSort {
public static void quickSort(int[] arr, int low, int high) {
if (low < high) {
int pivot = partition(arr, low, high);
quickSort(arr, low, pivot - 1);
quickSort(arr, pivot + 1, high);
}
}
private static int partition(int[] arr, int low, int high) {
int temp = arr[low];
int 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;
}
private static int partition(int[] arr, int[] temp, int low, int high) {
int 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;
return low;
}
public static void quickSortExtraArray(int[] arr, int[] temp, int low, int high) {
if (low < high) {
int pivot = partition(arr, temp, low, high);
int i;
for (i = low; i < pivot; i++) {
arr[i] = temp[i];
}
quickSortExtraArray(arr, temp, low, pivot - 1);
for (i = pivot + 1; i <= high; i++) {
arr[i] = temp[i];
}
quickSortExtraArray(arr, temp, pivot + 1, high);
}
}
}
选择式排序
选择排序
简单的选取然后交换
package sort;
/**
* @author bbyh
* @date 2022/11/19 0019 18:38
* @description
*/
public class SelectSort {
public static void selectSort(int[] arr, int length) {
int i, j;
int index;
int 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;
}
}
}
}
堆排序
堆排序是利用大根堆或者小根堆实现的排序,在这个排序里面要解决两个问题,如何建立一个堆,以及如何对堆进行调整
需要注意的是,堆排序比较在意下标的变化,在 建堆 和 堆调整时,如果下标都采用 i < high 则没问题,但如果是采用 i <= high ,则会在建堆的时候出现小问题,而且只对小根堆出现问题,大根堆不会出现问题
下面是采用 大根堆 进行的升序排序
package sort;
/**
* @author bbyh
* @date 2022/11/19 0019 18:39
* @description
*/
public class HeapSort {
private static final int NUM = 2;
private static void heapAdjust(int[] arr, int low, int high) {
int temp = arr[low];
int i;
for (i = NUM * low; i < high; i *= NUM) {
if (arr[i] < arr[i + 1]) {
i++;
}
if (temp >= arr[i]) {
break;
}
arr[low] = arr[i];
low = i;
}
arr[low] = temp;
}
private static void createHeap(int[] arr, int length) {
int i;
for (i = length / NUM; i >= 0; i--) {
heapAdjust(arr, i, length);
}
}
public static void heapSort(int[] arr, int length) {
createHeap(arr, length);
int i;
int temp;
for (i = length - 1; i > 0; i--) {
temp = arr[0];
arr[0] = arr[i];
arr[i] = temp;
heapAdjust(arr, 0, i - 1);
}
}
}
归并排序
这里采用经典的递归实现,左划分,右划分,然后合并
package sort;
/**
* @author bbyh
* @date 2022/11/19 0019 18:44
* @description
*/
public class MergeSort {
private static void merge(int[] arr, int[] 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];
}
}
public static void mergeSort(int[] arr, int[] 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);
}
}
基数排序
不同于前面的比较式排序,这里采用桶思想,每次放入对应桶,从低位到高位,放入取出结束后,序列就有序了
package sort;
/**
* @author bbyh
* @date 2022/11/19 0019 18:46
* @description
*/
public class RadixSort {
private static final int NUM = 10;
private static int getMax(int[] a, int length) {
int i, max;
max = a[0];
for (i = 1; i < length; i++) {
if (a[i] > max) {
max = a[i];
}
}
return max;
}
private static void countSort(int[] a, int length, int exp) {
int[] temp = new int[length];
int[] buckets = new int[NUM];
int i;
for (i = 0; i < length; i++) {
buckets[(a[i] / exp) % NUM]++;
}
for (i = 1; i < NUM; i++) {
buckets[i] += buckets[i - 1];
}
for (i = length - 1; i >= 0; i--) {
temp[buckets[(a[i] / exp) % NUM] - 1] = a[i];
buckets[(a[i] / exp) % NUM]--;
}
for (i = 0; i < length; i++) {
a[i] = temp[i];
}
}
public static void radixSort(int[] a, int length) {
int exp;
int max = getMax(a, length);
for (exp = 1; max / exp > 0; exp *= NUM) {
countSort(a, length, exp);
}
}
}