Heap Sorting Algorithm The heap sort algorithm is a arrangement and therefore the heaps are arrays of binary trees. Each node of the binary tree corresponds to a component of the array. Since a node has zero, one or two child nodes, for the i-th element of the array, the 2-th and (2i + 1) -th elements are its left and right children respectively.The following...