堆排序 Java

这个代码完全是按照算法导论上关于堆排序算法的描述实现的，如果想深入了解堆排序算法，读一读算法导论是非常有好处的。

</pre><pre name="code" class="java">package zsy.com;

public class HeapSortMethod {
	private static int heap_size;
	public static void main(String[] args) {
		int[] a = {4,1,3,2,16,9,10,14,8,7};
		HEAP_SORT(a);
		for(int i:a){
			System.out.print(i+" ");
		}
		
	}
	
	public static void HEAP_SORT(int[] a){
		BUILD_MAX_HEAP(a);
		for(int i = a.length;i >= 2;i--){
			swap(a,0,i-1);
			heap_size -= 1;
			MAX_HEAPIFY(a, 0);
		}
	}
	
	public static void MAX_HEAPIFY(int[] a,int i){
		int largest = 0;
		int l = i*2+1;
		int r = i*2+2;
		if(l < heap_size && a[i] < a[l]){
			largest = l;
		}else{
			largest = i;
		}
		if(r < heap_size && a[largest] < a[r]){
			largest = r;
		}
		if(largest!=i){
			swap(a,largest,i);
			MAX_HEAPIFY(a,largest);
		}
	}
	public static void BUILD_MAX_HEAP(int[] a){
		heap_size = a.length;
		for(int i=a.length-1;i>=0;i--){
			MAX_HEAPIFY(a,i);
		}
	}
	public static void swap(int[] a,int i,int j){
		a[i] = a[i] ^ a[j];
		a[j] = a[i] ^ a[j];
		a[i] = a[i] ^ a[j];
	}
}