comefrom: <gouthampradhan>binary_search_MinSortedRotatedArray_1.java
code: public int findMin(int[] nums) {
      if (nums.length == 0) return 0;
      else if (nums.length == 1) return nums[0];
      int low = 0, high = nums.length - 1;
      while (low < high) {
        int mid = (low + high) / 2;
        if (mid > 0 && nums[mid] < nums[mid - 1]) return nums[mid];
        if (nums[low] > nums[mid]) high = mid - 1;
        else if (nums[high] < nums[mid]) low = mid + 1;
        else high = mid - 1;
      }
      return nums[low];
    }
masked: public int sample_funcname ( int [ ] var_0 ) {
    if ( var_0 . length == 0 ) return 0 ;
    else if ( var_0 . length == 1 ) return var_0 [ 0 ] ;
    int var_1 = 0 , var_2 = var_0 . length - 1 ;
    while ( var_1 < var_2 ) {
      int var_3 = ( var_1 + var_2 ) / 2 ;
      if ( var_3 > 0 && var_0 [ var_3 ] < var_0 [ var_3 - 1 ] ) return var_0 [ var_3 ] ;
      if ( var_0 [ var_1 ] > var_0 [ var_3 ] ) var_2 = var_3 - 1 ;
      else if ( var_0 [ var_2 ] < var_0 [ var_3 ] ) var_1 = var_3 + 1 ;
      else var_2 = var_3 - 1 ;
    }
    return var_0 [ var_1 ] ;
  }
  