MindStudy - MindStudy

Question:

Published on: 19 April, 2024

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;
}

Subjects

Design and Analysis of Algorithm Data Structures & Algorithm Software Engineering Computer Graphics and Multimedia Database Management System Compiler Design

Trending

Write a C language function to delete the nth node of a singly-linked list. The error conditions are to be handled properly.

21 January, 2022

Convert the following infix expression Into equivalent postfix expression using stack.

\( {* C-(D-E)/(F+ G)}\)

What is dequeue?

23 January, 2022

a) Write an algorithm for deletion of a node from a doubly-linked list.

b) What is a threaded binary tree ? Write an algorithm for non-recursive in-order traversal of a threaded binary tree.

19 April, 2024

What is the benefit of using arrays of pointers instead of several pointer variables?

23 January, 2022

Describe a string reversal algorithm. Write the difference between a [ ] [ ] and **a.

19 April, 2024

Difference between MP4 and MP3