Question

Can someone please do it using the java language and please do it ASAP ? I would appreciate it.

Use the Heap class provided to implement a sort routine in a Main class where the user enters a series of values, each value is then pushed onto a heap, then the values are printed out in ascending order.

Answer 1

For solving the above question I firstly made a MAX heap form inserted values and then swap the root with end value and reduced the size of heap by 1. In this way, elements are sorted in ascending order.

Code is :-

public class Heap
{
    public static void main(String args[])
    {
        int values[] = {2,53,23,12,54,76,11,1};       // insertin random values in heap
        int n = values.length;          //calculating size of array
        sort(values);           // funtion to sort using heap sort
        System.out.println("Sorted array is");      //printing the elements in ascending order
        for (int i=0; i<n; ++i)
            System.out.print(values[i]+" ");
    }

    public static void sort(int values[])
    {
        int n = values.length;
        for (int i = (n / 2 - 1); i >= 0; i--)      // Building  heap by rearranging array
            heapify(values, n, i);
        for (int i=n-1; i>0; i--)       // One by one extract an element from heap
        {                               // Move current root to end
            int temp = values[0];
            values[0] = values[i];
            values[i] = temp;
            heapify(values, i, 0);                 // call max heapify on the reduced heap
        }
    }

    static void heapify(int arr[], int n, int i)
    {
        int large = i;
        int left = 2*i + 1; // left = 2*i + 1
        int right = 2*i + 2; // right = 2*i + 2
        if (left < n && arr[left] > arr[large])     //if left child is larger
            large = left;
       if (right < n && arr[right] > arr[large])    // If right child is largest
           large = right;
        if (large != i)     // If root is not largest than swap
        {
            int temp = arr[i];
            arr[i] = arr[large];
            arr[large] = temp;
            heapify(arr, n, large);     // recusive call to heapfiy function for sorting the subtree
        }
    }
}

Screenshot of code and it's output is :-

1 2 3 public class Heap { public static void main(String args[]) 4 { 5 6 7 int values[] = {2,53, 23,12,54,76,11,1}; // insertin random values in heap int n = values. Length; //calculating size of array sort (values); // funtion to sort using heap sort System.out.println("Sorted array is"); //printing the elements in ascending order for (int i=0; i<n; ++i) System.out.print(values[i]+" "); 8 9 10 11 12 } @ 13 14 15 16 17 18 public static void sort(int values[]) { int n = values.length; for (int i = (n / 2 - 1); i >= 0; i--) // Building heap by rearranging array heapify(values, n, i); for (int i=n-1; i>0; i--) // One by one extract an element from heap // Move current root to end int temp = values[0]; values[0] = values[i]; values[i] = temp; heapify(values, i, : 0); // call max heapify on the reduced heap { 19 20 21 22 23 24 25 26 }

27 28 29 30 31 static void heapify(int arr[], int n, int i) { int large = i; int left = 2*i + 1; // left = 2*i + 1 int right = 2*4 + 2; // right = 2*1 + 2 if (left <n && arr[left] > arr[large] //if left child is larger large = left; if (right <n && arr[right] > arr(large]) // If right child is largest large = right; if (large != i) // If root is not Zargest than swap 32 33 34 35 36 { 37 38 39 int temp = arr[i]; arr[i] = arr[large]; arr(large] = temp; heapify(arr, n, large); 40 41 // recusive call to heapfiy function for sorting the subtree 42 43 44

output -

"C:\Program Files\Java\jdk1.8.0_181\bin\java.exe" Sorted array is 1 2 11 12 23 53 54 76 Process finished with exit code o

HOPE YOU GOT IT !!!