Bước 5: Sử dụng các mã trong tập tin và thời gian thực thi của bạn như được đo với cơ sở, phát triển ước tính thứ tự của tầm quan trọng của thời gian thực hiện của unknownSort (). Giải thích ngắn gọn lý do đằng sau ước tính này. | LABORATORY 15 Step 3 Plot your results below. 1 000 2 000 3 000 4 000 Number of keys in the list numKeys 364 LABORATORY 15 Step 4 How well do your measured times conform with the order-of-magnitude estimates given for the seiectionSort and quickSort routines Step 5 Using the code in the file and your measured execution times as a basis develop an order-of-magnitude estimate of the execution time of the unknownsort routine. Briefly explain your reasoning behind this estimate. Team-Fly 365 LABORATORY 15 LABORATORY 15 In-lab Exercise 3 Name__ Hour Period Section__ Date__ In this exercise you measure the performance of the array and linked list implementations of the Stack ADT that you created in Laboratory 5. Step 1 Using the implementation of the Timer ADT that you created in the Prelab as a foundation write a program that measures the time it takes to completely fill and then empty a 10 000-element stack using the push and pop operations in Stack ADT. Assuming teststack is of type Stack you can use the following statement to print whether you are testing the class AStack or LStack Testing the Save your file as . Because these operations execute so rapidly you may need to fill and empty the stack a number of times in order to produce an accurate measurement of the time it takes to complete a fill empty cycle. Step 2 Use your program to measure the time it takes each of your Stack ADT implementations to fill and empty a stack containing 10 000 characters and record the results in the following table. .
