comefrom: <gouthampradhan>binary_search_SearchRotatedSortedArray_1.java
code: public int search(int[] nums, int target) {
      if (nums.length == 0) return -1;
      if (nums.length == 1) {
        return (nums[0] == target) ? 0 : -1;
      }
      int low = 0, high = nums.length - 1;
      while (low < high) {
        int mid = (low + high) >>> 1;
        if (nums[mid] == target) return mid;
        if ((nums[mid] <= nums[low]) && (target > nums[mid] && target <= nums[high])
            || (nums[low] <= nums[mid] && (target < nums[low] || target > nums[mid]))) low = mid + 1;
        else high = mid - 1;
      }
      return (nums[low] == target) ? low : -1;
    }
masked: public int sample_funcname ( int [ ] var_0 , int var_1 ) {
    if ( var_0 . length == 0 ) return - 1 ;
    if ( var_0 . length == 1 ) {
      return ( var_0 [ 0 ] == var_1 ) ? 0 : - 1 ;
    }
    int var_5 = 0 , var_6 = var_0 . length - 1 ;
    while ( var_5 < var_6 ) {
      int var_7 = ( var_5 + var_6 ) >>> 1 ;
      if ( var_0 [ var_7 ] == var_1 ) return var_7 ;
      if ( ( var_0 [ var_7 ] <= var_0 [ var_5 ] ) && ( var_1 > var_0 [ var_7 ] && var_1 <= var_0 [ var_6 ] ) || ( var_0 [ var_5 ] <= var_0 [ var_7 ] && ( var_1 < var_0 [ var_5 ] || var_1 > var_0 [ var_7 ] ) ) ) var_5 = var_7 + 1 ;
      else var_6 = var_7 - 1 ;
    }
    return ( var_0 [ var_5 ] == var_1 ) ? var_5 : - 1 ;
  }
  