8. search benchmarks 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.

the range is 19

step-by-step explanation:

the range is biggest number minus the smallest, so in this case it would be

41 - 22 = 19

what? ?

what type of question is thiss

step-by-step explanation:

walter needs to make at least 5 more cookies but no more than 40. 5 ≤ x ≤ 40

step-by-step explanation:

20 ≤ x + 15 ≤ 55

subtract 15 from all parts

20-15 ≤ x + 15-15 ≤ 55-15

5 ≤ x ≤ 40

this means how many more cookies he has to make

walter needs to make at least 5 more cookies, but no more than 40 cookies; 5 ≤ x ≤ 40