A Search for an Item X in a Portion of a Sorted

Multiple Choice

A search for an item X in a portion of a sorted array works by repeatedly selecting the middle item and comparing it to X.If X is not found there,the search method selects either the portion of the array to the left of the middle item,or the portion of the array to the right of the middle item,and continues the search.This method is called

A) sequential search
B) binary search
C) selection search
D) None of the above