Searching a Sorted Array in a Program

• The Arrays class contains a static binarySearch method
• The method returns either
  • The index of the element, if element is found
  • Or -k - 1 where k is the position before which
    the element should be inserted

    int[] a = { 1, 4, 9 };
    int v = 7;
    int pos = Arrays.binarySearch(a, v);
       // Returns -3; v should be inserted before position 2