<awangdev>Find Minimum in Rotated Sorted Array_2.java
public int findMin(int[] num) {
        if (num == null || num.length == 0) {
            return -1;
        }
        int start = 0;
        int end = num.length - 1;
        int mid = 0;
        while (start + 1 < end) {
            mid = start + (end - start) / 2;
            if (num[mid] > num[end]) {
                start = mid;
            } else {
                end = mid;
            }
        }
        if (num[start] < num[end]) {
            return num[start];
        } else {
            return num[end];
        }
    }
public int sample_funcname ( int [ ] var_0 ) {
  if ( var_0 == null || var_0 . length == 0 ) {
    return - 1 ;
  }
  int var_5 = 0 ;
  int var_6 = var_0 . length - 1 ;
  int var_7 = 0 ;
  while ( var_5 + 1 < var_6 ) {
    var_7 = var_5 + ( var_6 - var_5 ) / 2 ;
    if ( var_0 [ var_7 ] > var_0 [ var_6 ] ) {
      var_5 = var_7 ;
    }
    else {
      var_6 = var_7 ;
    }
  }
  if ( var_0 [ var_5 ] < var_0 [ var_6 ] ) {
    return var_0 [ var_5 ] ;
  }
  else {
    return var_0 [ var_6 ] ;
  }
}
