The binary search algorithm will have a maximum number of comparisons equal to the number of elements in the array will, normally, have the number of comparisons that is half the number of elements in the array is less efficient than the sequential search algorithm will cut the portion of the array being searched in half each time it fails to locate the search value

Hi!

The correct answer is:

The binary search algorithm will cut the portion of the array being searched in half each time it fails to locate the search value.

Explanation:

Important! The elements of the array have to be in order to perform a binary search.

For example.

An array of 10 position. Each position represent the value of the element.

If you have to seek the number 1:

      1  2  3  4  5  6  7  8  9  10

      1  2  3 4  --- 5  6  7  8  9  10

      1  --- 2  3 4  5  6  7  8  9  10

      1 --- 2 3 4  5  6  7  8  9  10

answer; (c) series 3; i believe this is the correct answer. good luck