From 7f2b9f5697a297c96b0ac12aa6c52cb2535d2a29 Mon Sep 17 00:00:00 2001
From: NamyaChandra <114582831+NamyaChandra@users.noreply.github.com>
Date: Sat, 8 Oct 2022 17:02:06 +0530
Subject: [PATCH] Create Heap Sort

Heap Sort implementation in python
---
 Heap Sort | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 Heap Sort

diff --git a/Heap Sort b/Heap Sort
new file mode 100644
index 0000000..80fc104
--- /dev/null
+++ b/Heap Sort	
@@ -0,0 +1,24 @@
+def heapify(arr, n, i):
+	largest = i 
+	l = 2 * i + 1 
+	r = 2 * i + 2 
+	if l < n and arr[i] < arr[l]:
+		largest = l
+	if r < n and arr[largest] < arr[r]:
+		largest = r
+if largest != i:
+		(arr[i], arr[largest]) = (arr[largest], arr[i])
+		heapify(arr, n, largest)
+def heapSort(arr):
+	n = len(arr)
+	for i in range(n // 2 - 1, -1, -1):
+		heapify(arr, n, i)
+for i in range(n - 1, 0, -1):
+		(arr[i], arr[0]) = (arr[0], arr[i]) 
+		heapify(arr, i, 0)
+arr = [12, 11, 13, 5, 6, 7, ]
+heapSort(arr)
+n = len(arr)
+print('Sorted array is')
+for i in range(n):
+	print(arr[i])