Write a program that has an array of at least 20 integers. it should call a function that uses the linear search algorithm to locate one of the values. the function should keep a count of the number of comparisons it makes until it finds the value. the program then should call a function that uses the binary search algorithm to locate the same value. it should also keep count of the number of comparisons it makes. display these values on the screen. in order for us to have the same answers let's initialize an array with these 20 integer values: 101, 142, 147, 189, 199, 207, 222, 234, 289, 296, 310, 319, 388, 394, 417, 429, 447, 521, 536, 600 let's search for value 521. these are the parameters used for a successful run of the program.

Following are the program in the C++ programming Language.

#include<iostream> // header file

using namespace std; // using namespace  

int binary_Searching(int arr[], int n, int key1) // function definition of binary search

{

int l1 = 0, h1 = n - 1, mid; // variable declaration

int r = 0; // holding result

while (l1 <= h1)  

{

r++; // increment of r

mid =(l1 + h1) / 2; // calculating the mid value

if(arr[mid] == key1) // checking the condition if the searching value is mid value

{

return r; // return r

}

else if (arr[mid]<key1) // checking the condition

{

l1 = mid + 1;  

}  

else

{

h1 = mid - 1;

}

}

return r; // reurn r

}

int linear_Searching(int arr[], int n, int key1) // function definition

{

int k,index = -1; // variable declaration

for(k= 0;k<n;k++) // iterating over the loop

{

if(arr[k] == key1) // checking the condition

{

if(index == -1)

{

index = k;

break; // break the program

}

}

}

return index+1; // return the index

}

int main() // main method

{

int arr[20] = {101, 142, 147, 189, 199, 207, 222, 234, 289, 296, 310, 319, 388, 394, 417, 429, 447, 521, 536, 600 };// declaring an array  

int result=binary_Searching(arr,20,521); // calling the function binary serach

cout<<"Total number of Binary search comparisons: "<<result<<endl;

int reult1=linear_Searching(arr,20,521); // calling the function linear serach

cout<<"Total number of Linear search comparisons: "<<reult1<<endl;

return 0;

}

Output:

Total number of Binary search comparisons: 3

Total number of Linear search comparisons:  18

Explanation:

Here, we define the integer type function " binary_Searching()" and pass three integer type arguments in its parameter i.e., "arr[]" which is array type, "n", and "key1" and inside the function.

Here, we define the integer type function "linear_Searching()" and pass three integer type arguments in its parameter i.e., "arr[]" which is array type, "n", and "key1" and inside the function.

Finally, we set the main method "main()" inside it, we set an integer type array variable and pass elements init then, we call bothe the variable and passing the values in its parameter and store them in other integer variable and print the following results.

click the big logo on the top left of the screen.   hope this !

-ttl

answer(a) occurs after your prediction;