comefrom: <qiyuangong>153_Find_Minimum_in_Rotated_Sorted_Array_1.py
code: def findMin( nums):
      l, r = 0, len(nums) - 1
      while l < r and nums[l] >= nums[r]:
          mid = (l + r) / 2
          if nums[mid] > nums[r]:
              l = mid + 1
          else:
              r = mid
      return nums[l]
masked: def sample_funcname ( var_0 ) :
      var_2 , var_5 = 0 , len ( var_0 ) - 1
      while var_2 < var_5 and var_0 [ var_2 ] >= var_0 [ var_5 ] :
          var_7 = ( var_2 + var_5 ) / 2
          if var_0 [ var_7 ] > var_0 [ var_5 ] :
              var_2 = var_7 + 1
          else :
              var_5 = var_7
      return var_0 [ var_2 ]
  