comefrom: <awangdev>Find Minimum in Rotated Sorted Array_2.java
code: 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];
          }
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 == null || var_0 . length == 0 ) {
      return - 1 ;
    }
    int var_1 = 0 ;
    int var_2 = var_0 . length - 1 ;
    int var_3 = 0 ;
    while ( var_1 + 1 < var_2 ) {
      var_3 = var_1 + ( var_2 - var_1 ) / 2 ;
      if ( var_0 [ var_3 ] > var_0 [ var_2 ] ) {
        var_1 = var_3 ;
      }
      else {
        var_2 = var_3 ;
      }
    }
    if ( var_0 [ var_1 ] < var_0 [ var_2 ] ) {
      return var_0 [ var_1 ] ;
    }
    else {
      return var_0 [ var_2 ] ;
    }
  }
  