🎴 Flashcard Mode
Java Programming Fundamentals
What will be the outcome of line no. 9 in the following program ? 1. public class SearchArray { 2. public static void main(String[] args) { 3. String[] strArr = {"one","two","three","four","five","six","seven"}; 4. boolean[] boolArr = {true,false,false,true,false}; 5. int[] intArr = {22,11,66,99}; 6. Arrays.sort(intArr); 7. for(int n=0; n<intArr.length; n++) 8. {System.out.println(n+". "+intArr[n]);} 9. System.out.println(Arrays.binarySearch(intArr,67)); 10. } 11. }
Sorting the array results in eleven, twenty-two, sixty-six, ninety-nine. Searching for sixty-seven yields a insertion point of index three. Using the binary search return formula, negative insertion point minus one, returns negative four. Distractors are incorrect calculations.