堆排序 java实现

public static void main(String[] args) {
		int[] a = { 2, 3, 2, 33, 45, 21, 45, 754, 23, 4, 17, 9 };
		System.out.println("before:");
		for (int i : a)
			System.out.print(i + " ");
		heapsort(a);
		System.out.println();
		System.out.println("after:");
		for (int i : a)
			System.out.print(i + " ");
	}

	public static void heapsort(int[] a) {
		// 建堆
		for (int i = a.length / 2; i >= 0; i--) {
			maxheap(a, a.length, i);
		}

		int temp;
		for (int i = a.length - 1; i >= 1; i--) {
			temp = a[0];
			a[0] = a[i];
			a[i] = temp;
			maxheap(a, i, 0);
		}
	}

	public static void maxheap(int[] a, int len, int index) {
		int left = index * 2 + 1;
		int right = index * 2 + 2;
		int large = index;
		int temp;
		if (left < len && a[left] > a[large])
			large = left;
		if (right < len && a[right] > a[large])
			large = right;
		if (large != index) {
			temp = a[index];
			a[index] = a[large];
			a[large] = temp;
			maxheap(a, len, large);
		}
	}