From 725f848f5556d22d9419d55c346e0b3e5cc00a02 Mon Sep 17 00:00:00 2001
From: Rufus paul <77576071+Rufus-paul@users.noreply.github.com>
Date: Sat, 15 Oct 2022 23:09:22 +0530
Subject: [PATCH] added code for heapsort

---
 Heapsort.java | 54 +++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 54 insertions(+)
 create mode 100644 Heapsort.java

diff --git a/Heapsort.java b/Heapsort.java
new file mode 100644
index 0000000..2bd5a31
--- /dev/null
+++ b/Heapsort.java
@@ -0,0 +1,54 @@
+// HeapSort
+public class HeapSort
+{
+	public void sort(int arr[])
+	{
+		int n = arr.length;
+		for (int i = n / 2 - 1; i >= 0; i--)
+			heapify(arr, n, i);
+		for (int i=n-1; i>=0; i--)
+		{
+			int temp = arr[0];
+			arr[0] = arr[i];
+			arr[i] = temp;
+			heapify(arr, i, 0);
+		}
+	}
+	void heapify(int arr[], int n, int i)
+	{
+		int largest = i; 
+		int l = 2*i + 1; 
+		int r = 2*i + 2; 
+		if (l < n && arr[l] > arr[largest])
+			largest = l;
+		if (r < n && arr[r] > arr[largest])
+			largest = r;
+		if (largest != i)
+		{
+			int swap = arr[i];
+			arr[i] = arr[largest];
+			arr[largest] = swap;
+			heapify(arr, n, largest);
+		}
+	}
+	static void printArray(int arr[])
+	{
+		int n = arr.length;
+		for (int i=0; i<n; ++i)
+			System.out.print(arr[i]+" ");
+		System.out.println();
+	}
+	public static void main(String args[])
+	{
+		int arr[] = {12, 11, 13, 5, 6, 7};
+		int n = arr.length;
+
+		HeapSort ob = new HeapSort();
+		ob.sort(arr);
+
+		System.out.println("Sorted array is");
+		printArray(arr);
+	}
+}
+
+// code by Rufus paul