🔥 created the implementation for the heap sort in java

Author: JatinBisht2308

HeapSort.java

@@ -0,0 +1,72 @@
+public class HeapSort {
+    public void sort(int arr[])
+    {
+        int N = arr.length;
+ 
+        // Build heap (rearrange array)
+        for (int i = N / 2 - 1; i >= 0; i--)
+            heapify(arr, N, i);
+ 
+        // One by one extract an element from heap
+        for (int i = N - 1; i > 0; i--) {
+            // Move current root to end
+            int temp = arr[0];
+            arr[0] = arr[i];
+            arr[i] = temp;
+ 
+            // call max heapify on the reduced heap
+            heapify(arr, i, 0);
+        }
+    }
+ 
+    // To heapify a subtree rooted with node i which is
+    // an index in arr[]. n is size of heap
+    void heapify(int arr[], int N, int i)
+    {
+        int largest = i; // Initialize largest as root
+        int l = 2 * i + 1; // left = 2*i + 1
+        int r = 2 * i + 2; // right = 2*i + 2
+ 
+        // If left child is larger than root
+        if (l < N && arr[l] > arr[largest])
+            largest = l;
+ 
+        // If right child is larger than largest so far
+        if (r < N && arr[r] > arr[largest])
+            largest = r;
+ 
+        // If largest is not root
+        if (largest != i) {
+            int swap = arr[i];
+            arr[i] = arr[largest];
+            arr[largest] = swap;
+ 
+            // Recursively heapify the affected sub-tree
+            heapify(arr, N, largest);
+        }
+    }
+ 
+    /* A utility function to print array of size n */
+    static void printArray(int arr[])
+    {
+        int N = arr.length;
+ 
+        for (int i = 0; i < N; ++i)
+            System.out.print(arr[i] + " ");
+        System.out.println();
+    }
+ 
+    // Driver's code
+    public static void main(String args[])
+    {
+        int arr[] = { 12, 11, 13, 5, 6, 7 };
+        int N = arr.length;
+ 
+        // Function call
+        HeapSort ob = new HeapSort();
+        ob.sort(arr);
+ 
+        System.out.println("Sorted array is");
+        printArray(arr);
+    }
+}

main.java

@@ -1,50 +1,50 @@
-public class Main {  
-        public static void main(String[] args) {  
-            Main Obj = new Main();  
-            Obj.add(11);  
-            Obj.add(22);  
-            Obj.add(33);  
-            Obj.add(44); 
-			Obj.add(55); 
-            Obj.print();  
-        }  
-        public class Node{  
-            int element;  
-            Node next;  
-            public Node(int element) {  
-                this.element = element;  
-            }  
-        }  
-          
-        public Node head = null;  
-        public Node tail = null;  
-          
-        public void add(int element){  
-            Node newEle = new Node(element);  
-            if(head == null) {  
-                head = newEle;  
-                tail = newEle;  
-                newEle.next = head;  
-            }  
-            else {  
-                tail.next = newEle;  
-                tail = newEle;  
-                tail.next = head;  
-            }  
-        }  
-          
-        public void print() {  //print function
-            Node current = head;  
-            if(head == null) {  
-                System.out.println("List is empty");  
-            }  
-            else {  
-                System.out.println("Nodes of the circular linked list: ");  
-                 do{  
-                    System.out.print(" "+ current.element);  
-                    current = current.next;  
-                }while(current != head);  
-                System.out.println();  
-            }  
-        }  
-    }
+public class Main {  
+        public static void main(String[] args) {  
+            Main Obj = new Main();  
+            Obj.add(11);  
+            Obj.add(22);  
+            Obj.add(33);  
+            Obj.add(44); 
+			Obj.add(55); 
+            Obj.print();  
+        }  
+        public class Node{  
+            int element;  
+            Node next;  
+            public Node(int element) {  
+                this.element = element;  
+            }  
+        }  
+          
+        public Node head = null;  
+        public Node tail = null;  
+          
+        public void add(int element){  
+            Node newEle = new Node(element);  
+            if(head == null) {  
+                head = newEle;  
+                tail = newEle;  
+                newEle.next = head;  
+            }  
+            else {  
+                tail.next = newEle;  
+                tail = newEle;  
+                tail.next = head;  
+            }  
+        }  
+          
+        public void print() {  //print function
+            Node current = head;  
+            if(head == null) {  
+                System.out.println("List is empty");  
+            }  
+            else {  
+                System.out.println("Nodes of the circular linked list: ");  
+                 do{  
+                    System.out.print(" "+ current.element);  
+                    current = current.next;  
+                }while(current != head);  
+                System.out.println();  
+            }  
+        }  
+    }