Sequential Search Algorithm

Input:

$$ positive integer n

$$ array of keys $($integers$)$ S$,$ indexed from $1$ to n

$$ a key x

Output: the location of x in S $(0$ if x is not in S$)$

Binary Search Algorithm

Input and Output are the same as above, except the input array S must be sorted.

Note: The $$ symbols represent the floor function.

Task $1.$ Implement Sequential Search Algorithm, test it on $1000$; $100,000$ and $1,000,000$ randomly generated numbers, and record the number of keys that were checked until x was found.

Count for $1,000$: $\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

Count for $100,000$: $\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

Count for $1,000,000$: $\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

Task $2.$ Implement Binary Search Algorithm, test it on $1000$; $100,000$ and $1,000,000$ randomly generated $($sorted$)$ numbers, and record the number of keys that were checked until x was found.

Count for $1,000$: $\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

Count for $100,000$: $\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$

Count for $1,000,000$: $\_\_\_\_$