排序总结二(java实现)

6.直接选择排序(不稳定)

思想:第ｉ次遍历时,找到最小值及其下标,该最小值与数组ｉ下标处的元素交换.

<span style="font-size:14px;"><em>public void selectSort() {
		int i, j, l, min;
		for (i = 0; i < a.length; i++) {
			min = a[i];   //初始化最小值
			l = i;
			for (j = i+1; j < a.length; j++) {
				if (a[j] < min) {
					min = a[j];
					l = j;  //标记最小值所在下标
				}
			}
			a[l] = a[i];  //交换
			a[i] = min;
		}
		for (i = 0; i < n; i++) {
			System.out.print(a[i]);
		}
		System.out.println();
	}</em></span>

7.堆排序

<span style="font-size:14px;"><em>// 堆插入(小根堆)
	public void heapInsert(int[] a, int i, int n) {
		int j, temp;
		temp = a[i];
		j = (i - 1) / 2;
		while (j > 0 && i != 0) {
			if (a[j] <= temp)
				break;
			a[i] = a[j];
			i = j;
			j = (i - 1) / 2;
		}
		a[i] = temp;
		for (i = 0; i < n; i++) {
			System.out.print(a[i]);
		}
		System.out.println();
	}

	// 堆化数组
	public void heapArray() {
		for (int i = (n - 1) / 2; i >= 0; i--) {
			heapDelete(a, i, n);
		}
	}

	// 在最小堆中删除数
	public void heapDeleteNum(int[] a, int n) {
		swap(a[0], a[n - 1]); // 交换根结点和最后一个结点
		heapDelete(a, 0, n - 1);
	}

	private void swap(int a, int b) {
		int temp = a;
		a = b;
		b = temp;
	}

	// 堆删除(小根堆),从i结点开始调整,n为结点总数,
	// 从0开始计算,2*i+1为左子结点,2*i+2为右子结点
	public void heapDelete(int[] a, int i, int n) {
		int j, temp;
		temp = a[i];
		j = 2 * i + 1;
		while (j < n) {
			if (j + 1 < n && a[j + 1] < a[j])// 从左右子结点中找最小的
				j++;
			if (a[j] >= temp)
				break;
			a[i] = a[j]; // 把较小的子结点往上移动,替换它的父结点
			i = j;
			j = 2 * i + 1;
		}
		a[i] = temp;
	}</em></span>

8.归并排序

思想:将若干个有序的子文件合并成一个有序的文件.

// 归并排序
	public void mergeSort(int a[], int begin, int end, int temp[]) {
		if (begin < end) {
			int mid = (begin + end) / 2;
			mergeSort(a, begin, mid, temp); // 左边有序
			mergeSort(a, mid + 1, end, temp);// 右边有序
			mergeArray(a, begin, mid, end, temp);// 左右两边合并
		}
	}

	private void mergeArray(int[] a, int begin, int mid, int end, int[] temp) {
		int i = begin, m = mid, j = mid + 1;
		int k = 0;
		while (i <= m && j <= end) {
			if (a[i] <= a[j]) {
				temp[k++] = a[i++];
			} else {
				temp[k++] = a[j++];
			}
		}
		while (i <= m) {
			temp[k++] = a[i++];
		}
		while (j <= end) {
			temp[k++] = a[j++];
		}

		for (i = 0; i < k; i++) {
			a[begin + i] = temp[i];
		}
	}

9.折半插入排序

<span style="font-size:14px;"><em>// 折半插入排序算法
	public void halfSort() {
		int low, high, mid;
		for (int i = 0; i < n; i++) {
			temp = a[i];
			low = 0;
			high = i - 1;
			while (low <= high) {
				mid = low + (high - low) / 2;
				if (a[mid] > temp) {
					high = mid - 1;
				} else {
					low = mid + 1;
				}
			}
			for (int j = i - 1; j > high; j--) {
				a[j + 1] = a[j];
			}
			a[high + 1] = temp;
		}

		for (int i = 0; i < n; i++) {
			System.out.print(a[i]);
		}
		System.out.println();
	}</em></span>