**Heap sort Intro**: Heap sort may be a comparison based sorting technique based on Binary Heap data structure. it’s almost like selection sort wherever we 1st realize the maximum element and place the maximum element at the end. we repeat the same method for remaining element.

In computing, heap sort is a comparison-based algorithmic rule. Heap sort is often thought of as an improved selection sort: like that algorithm, it divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the biggest element and moving that to the sorted region. The improvement consists of the utilization of a heap data structure instead of a linear-time search to seek out the maximum.

**Explanations**:

A sorting algorithm that works by first organizing the data to be sorted into a special type of binary tree called a heap. The heap itself has, by definition, the largest value at the top of the tree, so the heap sort algorithm must also reverse the order. It does this with the following steps:

1. Remove the topmost item (the largest) and replace it with the rightmost leaf. The topmost item is stored in an array.

2. Re-establish the heap.

3. Repeat steps 1 and 2 until there are no more items left in the heap.

The sorted elements are now stored in an array.

A heap sort is especially efficient for data that is already stored in a binary tree. In most cases, however, the quick sort algorithm is more efficient.

**Pseudo Code**:

procedure heapsort(a, count) is input: an unordered arrayaof lengthcount(Build the heap in array a so that largest value is at the root)heapify(a, count)(The following loop maintains the invariants that a[0:end] is a heap and every elementbeyond end is greater than everything before it (so a[end:count] is in sorted order))end ← count - 1 while end > 0 do(a[0] is the root and largest value. The swap moves it in front of the sorted elements.)swap(a[end], a[0])(the heap size is reduced by one)end ← end - 1(the swap ruined the heap property, so restore it)siftDown(a, 0, end)

(Put elements of 'a' in heap order, in-place)procedure heapify(a, count) is(start is assigned the index in 'a' of the last parent node)(the last element in a 0-based array is at index count-1; find the parent of that element)start ← iParent(count-1) while start ≥ 0 do(sift down the node at index 'start' to the proper place such that all nodes belowthe start index are in heap order)siftDown(a, start, count - 1)(go to the next parent node)start ← start - 1(after sifting down the root all nodes/elements are in heap order)(Repair the heap whose root element is at index 'start', assuming the heaps rooted at its children are valid)procedure siftDown(a, start, end) is root ← start while iLeftChild(root) ≤ end do(While the root has at least one child)child ← iLeftChild(root)(Left child of root)swap ← root(Keeps track of child to swap with)if a[swap] < a[child] swap ← child(If there is a right child and that child is greater)if child+1 ≤ end and a[swap] < a[child+1] swap ← child + 1 if swap = root(The root holds the largest element. Since we assume the heaps rooted at thechildren are valid, this means that we are done.)return else swap(a[root], a[swap]) root ← swap(repeat to continue sifting down the child now)