Question

Implement the algorithm Build Heap in C (or C++). Algorithm buildHeap (heap, size) set walker to 1 loop (walker < size) reheapUp (heap, walker) increment walker end loop Write a program to test your program using a random integer array of size 30. Print the arrays before and after building the heap.

Answer 1

// C++ Code to demonstrate the build heap function (Max heap):-

#include<bits/stdc++.h>
using namespace std;
void reheapUp(int heap[],int i)
{
int j=i;
while(j>0)
{
int index=int((j-1)/2);
if(heap[index]<heap[j])
{
swap(heap[index],heap[j]);
j=index;
}
else
break;
}
}

// Implementing function as given in algorithm in question.
// only change is indexing is start with 0 instead of 1.
void buildHeap(int heap[],int size)
{
int walker=0;
while(walker<size)
{
reheapUp(heap,walker);
walker+=1;
}
}
int main()
{
// Declaring array of 30 random values.
int heap[30]={12,36,58,45,13,18,27,26,32,42,57,68,77,82,85,92,96,87,1,17,16,75,46,88,81,55,67,58,99,10};
int i;
  
// Printing array before builiding the heap.
cout<<"Array Before :"<<endl;
for(i=0;i<30;i++)
cout<<heap[i]<<" ";
cout<<endl;
  
// Calling function to build the heap.
buildHeap(heap,30);
cout<<endl;
  
// Printing array after builiding the heap.
cout<<"Array After :"<<endl;
for(i=0;i<30;i++)
cout<<heap[i]<<" ";
cout<<endl;
return 0;
}

main.cpp 1 #include<bits/stdc++.h> 2 using namespace std; 3 void reheapUp(int heap[], int i) 5 int j=i; while(j>o) 6 { 7 8 9 { } } int index=int((j-1)/2); if(heap[index]<heap[j]) 10 11 swap(heap[index], heap[j]); 12 j=index; 13 14 else 15 break; 16 17 } 18 19 // Implementing function as given in algorithm in question. 20 // only change is indexing is start with o instead of 1. 21 void buildHeap(int heap[], int size) 22 - { 23 int walker=0; 24 while(walker size) 25 reheapUp (heap, walker); 27 walker+=1; 28 29} int main() 31- { 32 // Declaring array of 30 random values. 33 int heap[30]={12,36,58,45,13,18,27,26,32,42,57,68,77,82,85,92,96,87,1,17,16,75,46,88,81,55,67,58,99,10}; int i; { 26 بہ 30 34 35

36 // Printing array before builiding the heap. 37 cout<<"Array Before :"<<endl; 38 for(i=0;i<30;i++) 39 cout<<heap[i]<<" "; 40 cout<<endl; 41 42 // calling function to build the heap. 43 buildHeap(heap, 30); 44 cout<<endl; 45 46 // Printing array after builiding the heap. 47 cout<<"Array After :"<<endl; 48 for(i=0;i<30;i++) 49 cout<<heap[i]<<" "; 50 cout<<endl; 51 return 0; 52 } input Array Before : 12 36 58 45 13 18 27 26 32 42 57 68 77 82 85 92 96 87 1 17 16 75 46 88 81 55 67 58 99 10 Array After : 99 92 96 87 75 82 88 57 85 17 46 81 67 77 68 12 32 26 1 13 16 42 45 18 58 36 55 27 58 10 - - Program finished with exit code 0 Press ENTER to exit console. I