h82258652的专栏

public static void QSort(int[] array, int low, int high){ int left = low; int right = high; int pivotkey = array[left]; while (left < right) { while (left = pivotkey)

/// /// 希尔排序/// /// 需要排序的数组public static void ShellSort(int[] array){ int i, j, temp, length = array.Length, gap = length >> 2; for (; gap > 0; gap >>= 2) { for (i = gap; i <

/// /// 选择排序/// /// 需要排序的数组public static void SelectSort(int[] array){ int min;// 当前剩余数组的最小数的下标 for (int i = 0; i < array.Length; i++) { min = i; #region 查找数组中剩余的最小值的下

/// /// 归并排序/// /// 已排序的第一个数组/// 已排序的第二个数组/// 合并后的数组public static int[] MergeSort(int[] a, int[] b){ int[] result = new int[a.Length + b.Length];// 合并后的数组 int aIndex = 0, bIndex = 0;//

/// /// 双向冒泡排序/// /// 需要排序的数组public static void TwoWayBubbleSort(int[] array){ int maxindex = array.Length - 1, left = 0, right = maxindex, i;// maxindex为数组最大下标，left为左游标，right为右游标 while (