Create Heap Sort .cpp

I have uploaded Complete heap sort in C++ along with Time complexity

Author: Arpit0324

sorting/Heap Sort .cpp

@@ -0,0 +1,59 @@
+#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 left child is larger than root
+    if (l < n && arr[l] > arr[largest])
+        largest = l;
+    //If right child largest 
+    if (r < n && arr[r] > arr[largest])
+        largest = r;
+  //If root is nor largest
+    if (largest != i){
+        swap(arr[i], arr[largest]);
+      //Recursively heapifying the sub-tree
+        heapify(arr, n, largest);
+    }
+}
+
+void heapSort(int arr[], int n){
+    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--){
+        //Moving current root to end
+        swap(arr[0], arr[i]);
+      //Calling max heapify on the reduced heap
+        heapify(arr, i, 0);
+    }
+}
+ //Function to print array
+void display(int arr[], int n){
+    for (int i = 0; i < n; i++){
+        cout << arr[i] << "\t";
+    }
+    cout << "\n";
+}
+int main(){
+    int arr[] = {1, 14, 3, 7, 0};
+    int n = sizeof(arr)/sizeof(arr[0]);
+    cout << "Unsorted array  \n";
+    display(arr, n);
+    heapSort(arr, n);
+ cout << "Sorted array  \n";
+    display(arr, n);
+}
+
+/*Time Complexcity
+Best
+O(nlog n)
+
+Average
+O(nlog n)
+
+Worst
+O(nlog n)
+*/