<awangdev>Find Minimum in Rotated Sorted Array II_1.java
public int findMin(int[] nums) {
        if (nums == null || nums.length == 0) {
            return 0;
        }
        int n = nums.length;
        int start = 0;
        int end = n - 1;
        while (start + 1 < end) {
            int mid = (start + end) >> 1;
            if (nums[mid] == nums[end]) {
                end--;
            } else if (nums[mid] > nums[end]) {
                start = mid;
            } else {
                end = mid;
            }
        }
        return nums[start] < nums[end] ? nums[start] : nums[end];
    }
public int sample_funcname ( int [ ] var_0 ) {
  if ( var_0 == null || var_0 . length == 0 ) {
    return 0 ;
  }
  int var_4 = var_0 . length ;
  int var_5 = 0 ;
  int var_7 = var_4 - 1 ;
  while ( var_5 + 1 < var_7 ) {
    int var_8 = ( var_5 + var_7 ) >> 1 ;
    if ( var_0 [ var_8 ] == var_0 [ var_7 ] ) {
      var_7 -- ;
    }
    else if ( var_0 [ var_8 ] > var_0 [ var_7 ] ) {
      var_5 = var_8 ;
    }
    else {
      var_7 = var_8 ;
    }
  }
  return var_0 [ var_5 ] < var_0 [ var_7 ] ? var_0 [ var_5 ] : var_0 [ var_7 ] ;
}
