heapsort

</pre><pre name="code" class="java">package Sort;

public class HeapSort {
	
	private static int N;
    /* Sort Function */
    public static void sort(int arr[])
    {       
        heapify(arr);        
        for (int i = N; i > 0; i--)
        {
            swap(arr,0, i);
            N = N-1;
            maxheap(arr, 0);
        }
    }     
    /* Function to build a heap */   
    public static void heapify(int arr[])
    {
        N = arr.length-1;
        for (int i = N/2; i >= 0; i--)
            maxheap(arr, i);        
    }
    /* Function to swap largest element in heap */        
    public static void maxheap(int arr[], int i)
    { 
        int left = 2*i ;
        int right = 2*i + 1;
        int max = i;
        if (left <= N && arr[left] > arr[i])
            max = left;
        if (right <= N && arr[right] > arr[max])        
            max = right;
 
        if (max != i)
        {
            swap(arr, i, max);
            maxheap(arr, max);
        }
    }    
    /* Function to swap two numbers in an array */
    public static void swap(int arr[], int i, int j)
    {
        int tmp = arr[i];
        arr[i] = arr[j];
        arr[j] = tmp; 
    } 
    /* Print arrary method */
    public static void print(int arr[])
    {
    	for(int i = 0; i < arr.length; i++)
    		System.out.print(arr[i]+"\t");
    	System.out.println();  
    }
    /* Main method */
    public static void main(String[] arg)
    {
    	int array[] = {1,4,6,8,3,3,34,56,90,234,1};
    	
    	System.out.println("Before sort: ");
    	print(array);
    	
    	sort(array);
    	
    	System.out.println("After sort: ");
    	print(array);
    }
}