Search Benchmark

Design an application that has an array of at least 20 integers. It should call a module that uses the sequential search algorithm to locate one of the values. The module should keep a count of the number of comparisons it makes until it finds the value. Then the program should call another module that uses the binary search algorithm to locate the same value. It should also keep a count of the number of comparisons it makes. Display these values on the screen.

Draw the flowchart and write the Pseudo Code Search Benchmarks with the following modifications:

1) make the array size 1000,

2) populate the array with random numbers between 1 and 100,

3) ask the customer for the number to find and

4) the output should look like this

The sequential search took nn comparisons and

The binary search took nn comparisons

PLEASE DO NOT RESPOND IN JAVA OR PYTHON!

Responses ONLY IN Gaddis Pseudo Code Please