Creation and insertion of Binary min heap

min_heap.cpp

#include <iostream>
#include <vector>
using namespace std;

vector <int> a = {0};

void insert(int ele){
    int temp;
    a.push_back(ele);
    long last = a.size()-1;
    while(a[last] < a[last/2] && last > 1){     // changing '<' to '>' becomes max_heap
        temp = a[last];
        a[last] = a[last/2];
        a[last/2] = temp;
        last = last/2;
    }
}

int main(){
    
    insert(30);
    insert(20);
    insert(15);
    insert(5);
    insert(10);
    insert(6);
    insert(40);

    for(int i=1;i<a.size();i++){
        cout << a[i] << " ";
    }
}