Question: ject 1: Program Performance Measurement blem Statement: In the algorithmic study, we often use the Big-O notation to describe the growth of each computer algorithm.



ject 1: Program Performance Measurement blem Statement: In the algorithmic study, we often use the Big-O notation to describe the growth of each computer algorithm. In this project, we would like to take a totally different approach. We would like to measure the exact execution time by measurement. Therefore, you will be required to measure the starting time and the ending time of a function call. Each function will be an example sorting algorithm implementation. For example, random_list_10_elements = generate_random(10) start_time = measure_of_system_time() sorted_list_10_elements = selection_sort(random_list_10_elements) end_time = measure_of_system_time() time_selection_sort_10_elements = end_time - start_time This is the pseudo code for the performance measurement of selection sort over 10 elements. To generate the 10-elements, please use random number generator which can generate number in the range of (0
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
