How is heap sort implemented?
- 1 Answers
- 928 Views
- I also Faced
- E-Mail Answers
Answer / Kumar Alok Ranjan
Heap Sort implements a binary heap data structure, either max-heap or min-heap. The array of elements is first built as a binary heap, then the root element (the maximum/minimum value) is swapped with the last element, and the binary heap is rebuilt on the remaining elements. This process is repeated until the binary heap is empty.
| Is This Answer Correct ? | 0 Yes | 0 No |
Is array a linked list?
Which is faster arraylist or hashmap?
What is inserting in data structure?
State the different ways of representing expressions?
Write an algorithm through which the inserting and deleting of elements can take place in circular queue?
Write the c program to insert a node in circular singly list at the beginning.
What are the different types of hash functions?
How to reverse singly link list?
How do you get placements?
Differentiate between collection and collections.
What is the difference between b tree and binary search tree?
Define a relation?
Windows 
