img
Question:
Published on: 1 July, 2022

Draw a minimum heap tree from the below list :

       12, 11, 7, 3, 10, – 5, 0, 9, 2

Now do the heap sort operation over the heap tree which you have formed. Write the insertion sort algorithm.

Answer:

 

Minimum heap tree create

Minimum Heap Tree

Insertion Sort Algorithm

for( i=1; i<n;i++)
 {
temp=a[i];
for(j=i-1;j>=0;j--)
{ 	
    if(temp<a[j])
       a[j+1]=a[j];
   else
      break;
}
a[j+1]=temp;
}
Random questions