Get the minimum value of a given sorted integer array. Complexity log(n)

gistfile1.java

public static int getMinValue(int[] a) {
   if (a == null)
      return -1;
   int lo = 0;
   int hi = a.length - 1;
   while (lo <= hi) {
      int mid = lo + (hi - lo) / 2;
      if (a[mid] > a[hi]) {
         lo = mid + 1;
      } else if (a[mid] < a[hi]) {
         hi = mid - 1;
      } else {
         return a[mid];
      }
   }
   return -1;
}