The partial binary search method below is designed to search an array of String objects sorted in ascending order.Select the expression that would be needed to complete the method.
A)a[low].compareTo(item)
B)item.compareTo(a[mid])
C)item.equals(a[mid])
D)a[mid].compareTo(item)

Question

The partial binary search method below is designed to search an array of String objects sorted in ascending order.Select the expression that would be needed to complete the method.  
A)a[low].compareTo(item) 
B)item.compareTo(a[mid]) 
C)item.equals(a[mid]) 
D)a[mid].compareTo(item)

Quizplus · Accepted Answer

The partial binary search method is searching for the position of the "item" string in the sorted "a" array, so we need to compare "item" with the middle element of the array "a[mid]" using the "compareTo()" method, which returns an integer value based on the lexicographical comparison of two strings. Therefore, the correct expression to complete the method is "a[mid].compareTo(item)".

The Partial Binary Search Method Below Is Designed to Search