Scribd
Upload
164 views1 page

Heap Sort

Heap sort is a sorting algorithm that uses a binary heap data structure. It works by building a max heap from the input data, then repeatedly removing the largest element from the heap and adding it to the end of the sorted portion of the array. To build the max heap, the heapify procedure is applied to nodes from the bottom up to ensure child nodes are heapified before parent nodes.

Uploaded by

anon_723333426
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
164 views1 page

Heap Sort

Heap sort is a sorting algorithm that uses a binary heap data structure. It works by building a max heap from the input data, then repeatedly removing the largest element from the heap and adding it to the end of the sorted portion of the array. To build the max heap, the heapify procedure is applied to nodes from the bottom up to ensure child nodes are heapified before parent nodes.

Uploaded by

anon_723333426
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Heap sort is a comparison based sorting technique based on Binary Heap data

structure. It is similar to selection sort where we first find the maximum element and
place the maximum element at the end. We repeat the same process for remaining
element.
What is Binary Heap?
Let us first define a Complete Binary Tree. A complete binary tree is a binary tree in
which every level, except possibly the last, is completely filled, and all nodes are as
far left as possible

A Binary Heap is a Complete Binary Tree where items are stored in a special order
such that value in a parent node is greater(or smaller) than the values in its two
children nodes. The former is called as max heap and the latter is called min heap.
The heap can be represented by binary tree or array.

Why array based representation for Binary Heap?


Since a Binary Heap is a Complete Binary Tree, it can be easily represented as
array and array based representation is space efficient. If the parent node is stored
at index I, the left child can be calculated by 2 * I + 1 and right child by 2 * I + 2
(assuming the indexing starts at 0).
Heap Sort Algorithm for sorting in increasing order:
1. Build a max heap from the input data.
2. At this point, the largest item is stored at the root of the heap. Replace it with the
last item of the heap followed by reducing the size of heap by 1. Finally, heapify the
root of tree.
3. Repeat above steps while size of heap is greater than 1.
How to build the heap?
Heapify procedure can be applied to a node only if its children nodes are heapified.
So the heapification must be performed in the bottom up order.

You might also like