Building Min-Heap using Heapify algorithm

 #include<bits/stdc++.h>

 using namespace std;

// Building Heapify algorihtm
// Time Complexity is O(n)
void Heapify(int arr[],int n,int i){
    int small=i;
    int left=2*i+1;
    int right=2*i+2;
    if(left<n && arr[small]>arr[left]){
        small=left;
    }
    if(right<n && arr[small]>arr[right]){
        small=right;
    }
    // checking the parent Node of its right position
    if(small!=i){
        swap(arr[small],arr[i]);
        Heapify(arr,n,small);
    }
}
int main(){
    int n=5;
    // 0 -> based indexing
    // 1-> based indexing
   int arr[6]={-1,54,53,55,52,50};
   for(int i=n/2-1;i>=0;i--){
       Heapify(arr,n,i);
   }
   for(int i=1;i<n;i++){
       cout<<arr[i]<<" ";
   }
    
}