Valid 1Z0-851 Dumps shared by ExamDiscuss.com for Helping Passing 1Z0-851 Exam! ExamDiscuss.com now offer the newest 1Z0-851 exam dumps, the ExamDiscuss.com 1Z0-851 exam questions have been updated and answers have been corrected get the newest ExamDiscuss.com 1Z0-851 dumps with Test Engine here:
Given: import java.util.*; public class Quest { public static void main(String[] args) { String[] colors = {"blue", "red", "green", "yellow", "orange"}; Arrays.sort(colors); int s2 = Arrays.binarySearch(colors, "orange"); int s3 = Arrays.binarySearch(colors, "violet"); System.out.println(s2 + " " + s3); } } What is the result?
Correct Answer: C
Explanation/Reference: Explanation: public static int binarySearch(Object[] a, Object key) Searches the specified array for the specified object using the binary search algorithm. The array must be sorted into ascending order according to the natural ordering of its elements (as by the sort(Object[]) method) prior to making this call. If it is not sorted, the results are undefined. (If the array contains elements that are not mutually comparable (for example, strings and integers), it cannot be sorted according to the natural ordering of its elements, hence results are undefined.) If the array contains multiple elements equal to the specified object, there is no guarantee which one will be found. Parameters: a - the array to be searched key - the value to be searched for Returns: index of the search key, if it is contained in the array; otherwise, (-(insertion point) - 1). The insertion point is defined as the point at which the key would be inserted into the array: the index of the first element greater than the key, or a.length if all elements in the array are less than the specified key. Note that this guarantees that the return value will be >= 0 if and only if the key is found. Throws: ClassCastException - if the search key is not comparable to the elements of the array.