The binary search algorithm

will cut the portion of the array being searched in half each time the loop fails to locate the search value

will have an average of N$/2$ comparisons, where N is the number of elements in the

is less efficient than the sequential search algorithm

will have a maximum number of comparisons equal to the number of elements$$in$$the$$array