Adding heapsort

Algorithms/Heapsort/C++/heapsort.cpp

@@ -0,0 +1,44 @@
+#include <iostream> 
+using namespace std; 
+
+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) {
+		swap(arr[i], arr[largest]);
+		heapify(arr, n, largest);
+	}
+}
+
+void heapSort(int arr[], int n) {
+	for (int i = n / 2 - 1; i >= 0; i--)
+		heapify(arr, n, i);
+
+	for (int i=n-1; i>=0; i--) {
+		swap(arr[0], arr[i]);
+
+		heapify(arr, i, 0);
+	}
+}
+
+int main() {
+    int n;
+    cin>>n;
+    int *arr = new int[n];
+    for(int i = 0;i < n;i++) {
+        cin>>arr[i];
+    }
+    heapSort(arr, n);
+    for(int i = 0;i < n;i++) {
+        cout<<arr[i]<<" ";
+    }
+    return 0;
+} 

Algorithms/Heapsort/python/heapsort.py

@@ -0,0 +1,34 @@
+def heapify(arr, n, i): 
+    largest = i
+    l, r = 2 * i + 1, 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[largest], arr[i] = arr[i], arr[largest]
+        heapify(arr, n, largest)
+
+def heapSort(arr, n):
+    for i in range(n, -1, -1): 
+        heapify(arr, n, i) 
+
+    for i in range(n - 1, 0, -1):
+        arr[0], arr[i] = arr[i], arr[0]
+        heapify(arr, i, 0) 
+
+arr = []
+n = int(input())
+for i in range(n):
+    curr = int(input())
+    arr.append(curr)
+
+heapSort(arr, n)
+
+print("Sorted array: ")
+for i in range(n):
+    print(arr[i], end = " ")
+