堆排序

堆排序

public class HeapSort {
	public static void heapsort(int [] a,int n){
		int i;
		for(i=n/2;i>0;i--){
			heapadjust(a,i,n);
		}
		for (i=n;i>1;i--){
			swap(a,1,i);
			heapadjust(a,1,i-1);
		}
		for(int k=0;k<a.length ;k++){
			System.out.print(a[k]+"   ");
		}
	}
	private static void swap(int[] a, int i, int j) {
		int temp;
		temp=a[i];
		a[i]=a[j];
		a[j]=temp;
	}
	private static void heapadjust(int[] a, int s, int n) {
		int i,temp;
		temp=a[s];
		for(i=2*s;i<=n;i*=2){
			if(i<n&&a[i]<a[i+1]){
				i++;
			}
			if(temp>=a[i]){
				break;
			}
			a[s]=a[i];
			s=i;
		}
		a[s]=temp;
	}
	public static void main(String[] args) {
		int [] a ={-1,1,2,3,0,9,8,7,6,5,4};
		heapsort(a,10);
	}
}