You are to create a program that enables you to measure the execution times of v

Question

You are to create a program that enables you to measure the execution times of various sorting algorithms to better understand their efficiency characteristics. For each sorting algorithm, you are to measure and record the execution times for various lists of randomly generated integers. The list sizes used for the test cases should start at 10,000, and go up by 10,000 for each test until the execution time for the test exceeds 60 seconds. The algorithms for which you are to run the tests are: Tree sort You are to report the execution times obtained for the algorithmsin a table with the following format: Execution times in seconds (use 22 decimal digits) List size Selection Sort Bubble sort Merge sort Tree sort 10,000 20,000 30,000 Note that since the algorithms have different efficiencies, execution times of over 60 seconds will be reached for different list sizes. Stop running tests for a given algorithm once you For each algorithm, create a line plot showing the list size on the x-axis and the execution time on the y-axis and include a discussion about whether the execution times obtained correspond to the big-O time efficiency of the algorithm.

Explanation / Answer

In your program add the following:
import time
Just before the call to particular sort function(say Treesort), following can be added
start_time = time.time()
After the call to particular sort function terminate, following can be added:
elapsed time = time.time() - start_time() // This will be in seconds

Related Questions

Navigate

• Browse (All)
• Browse Y
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.