In this project you are asked to compare between heapsort sorting algorithms that uses binary
and thulathi ( ثلاثي ) heaps. Randomly generate a list of size n, ensuring the same input list to both
sorting algorithms. Keep track of the execution time and the total number of comparisons.
We already discussed the binary heapsorting algorithm in class, however, the thulathi
heapsorting has exactly the same idea except in the heap where each node has three child.
Implement both heaps using arrays. For binary heap, a node k 1, will have its children at
positions 2k and 2k 1, while the parent node is at k / 2 . In the same way, the thulathi heap, a
node k 1, will have its 3 children at 3k 1,3k, and 3k 1. The parent is at (k 1)/ 3 .