Arrays & Searching Algorithms

Given the following array arr then answer the question below:

a$)$ Arrl$[4]=$arrl$[2]+$arrl$[3]$

b$)$ Arrl$\frac{5}{2}=?$

c$)$ Apply linear search to find if $11$ exist in arr$[]($show the steps$)$

Given the following array arr$2[]$ then answer the question below:

a$)$ Apply binary search to find if $72$ exist in arr$2($show the steps$)$

b$)$ Apply binary search to find if $1$ exist in arr$2[]($show the steps$)$

What is the time complexity of a binary search and linear search in worst cases?

Which will cause the shortest execution of a binary search and linear search?

If you had an ordered array of size $500,$ what is the maximum number of iterations required to

find an element with binary search?

If you had an ordered array of size $500,$ what is the maximum number of iterations required to

find an element with linear search?

What are the termiion condition for binary search and linear search?

Arrays & Searching Algorithms

Given the following array arr $1[]$ then answer the question below:

a$)$ Arr$1[4]=$arr$1[2]+$arr$1[3]$

b$)$ Arr$1\frac{5}{2}=?$

c$)$ Apply linear search to find if $11$ exist in arr$[]($show the steps$)$

Given the following array arr$2[]$ then answer the question below:

a$)$ Apply binary search to find if $72$ exist in arr$2[]($show the steps$)$

b$)$ Apply binary search to find if $1$ exist in arr$2[]($show the steps$)$

What is the time complexity of a binary search and linear search in worst cases?

Which will cause the shortest execution of a binary search and linear search?

If you had an ordered array of size $500,$ what is the maximum number of iterations required to

find an element with binary search?

If you had an ordered array of size $500,$ what is the maximum number of iterations required to

find an element with linear search?

What are the termination condition for binary search and linear search?