The linear search algorithm in order to manually count the number of steps it takes to compute the search result. Use different input sizes as specified below and note down the average number of steps of your algorithm for each input size.

Use the following table and report those numbers from your simulation. Input size: N random values (ranging between 0 and N), where N can be 10K, 20K, 30K, 40K, 50K, 60K, 70K, 80K, 90K, 100K Simulation size: 10,000.

 

Input size Hit Miss Time-> Max steps O(n) Deliverable 5: By using the tabular values, plot a graph similar to the graph shown above (you can use steps * 1ms to approximate the time required to run the algorithm). Compare your graph with the Big O plot that matches closely to your graph. Input Size - O(n) Min steps O(log n) 0(1) Average steps