9_max_heap(data_lab).cpp

#include<bits/stdc++.h>
using namespace std;

void heap(int tree[], int num , int item ){
int ptr , parent ;

if(num == 0)
    tree[1] =  item ;

else{
    num++;
    ptr =  num ;
    tree[ptr] =  item ;
    while(ptr>1 ){
      parent = ptr/2;

      if(tree[parent] >= tree[ptr] ){
          cout<< "end \n";
        tree[ptr] =  item ;
        return ;
      }

    swap(tree[ptr],tree[parent]);
    ptr = parent ;

    }
}
return ;
}

int main(){
int i , j ,k;
int arr[10000];

  printf("how many elements : ");
    scanf("%d",&k);

  printf("enter %d elements : ", k);
    for(i = 1; i<= k ;i++){
      scanf("%d", &j);
      heap(arr, i-1 , j);

    }

  printf("printing heap \n");

    for(i= 1; i <= k ;i++)
      printf("%d ",arr[i]);

return 0;}