package heap;

/**
 *
 * @author Winston Prakash
 */
public class HeapSort {
    int[] dataArray;
    int[] sortedArray;
    /** Creates a new instance of HeapSort */
    public HeapSort(int[] data) {
        dataArray = data;
    }
    
    public void Sort(){
        MaximumHeap maxHeap = new MaximumHeap(dataArray);
        maxHeap.build();
        sortedArray = new int[dataArray.length];
        for (int i =0; i< dataArray.length; i++){
            sortedArray[i] = maxHeap.extractMax();
        }
    }
    
    public void displayData(){
        System.out.println("\nUnsorted");
        for (int i =0; i< dataArray.length; i++){
            System.out.print(dataArray[i] + "  ");
        }
        System.out.println("\nSorted");
        for (int i =0; i< sortedArray.length; i++){
            System.out.print(sortedArray[i] + "  ");
        }
        System.out.println("\n\n");
    }
}