Write a program to take 5000, 10000, 20000, 50000 positive integer elements (ranges from 0 to 100,000) generated by a random function and do the following:

  • Insert them into a heap one by one.
  • Build a heap in linear time.

Output:

Run each algorithm and print out the following results:

  • Print out the running time of algorithms for each input data and draw a graph for the running times.
  • Print out the number of swaps for each algorithm.
Academic Honesty!
It is not our intention to break the school's academic policy. Posted solutions are meant to be used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly complete the form. Please provide a valid email address and we will get back to you within 24 hours. Payment is through PayPal, Buy me a Coffee or Cryptocurrency. We are a nonprofit organization however we need funds to keep this organization operating and to be able to complete our research and development projects.