Write a heapsort program that generates random numbers and insert them in heap. the
program then performs heapsort to sort the numbers in ascending order. implement the heap
using an array and compare its performance to stl heap implementation.
requirements:
1. use random number generator to generate integers numbers in range [0..1000]. your
program should prompt the user for the total number of numbers to generate. a listing
of the generated numbers should be printed on screen in the order they are generated.
allocate a dynamic array to store the numbers.
2. construct the heap by performing the heapify algorithm.
3. once the heap is constructed, perform heapsort algorithm and display the sorted list on
screen.