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
B) binary search
Computer Science & Information Technology
You might also like to view...
____ sized arrays are not initialized with a set size, but instead are sized at execution to accommodate the listed values.
A. Statically B. Baseline C. Standard D. Implicitly
Computer Science & Information Technology
To specify the location of a file within the Web, Web servers use a special kind of address called a uniform resource locator (URL).
Answer the following statement true (T) or false (F)
Computer Science & Information Technology