Offline 1 Objective: Comparison of Linear and Binary search
Task:
- You have to implement Linear search and binary search
- Populate the input array of size n by generating sorted random integers
- Randomly generate the key to search in the input array.
- Record the time to accomplish the searches
- The input size can vary from 10 to 10000.
- Plot running time of both the search algorithm against the input array size n (ex:
n=10,100,200,500,1000,2000,5000,10000)
Submission:
- Code in C++
- You have to submit the codes and a report containing the plots


