comefrom: <awangdev>Classical Binary Search_1.java
code: public int findPosition(int[] nums, int target) {
          if (nums == null || nums.length == 0) {
              return -1;
          }
          int start = 0;
          int end = nums.length - 1;
          while (start + 1 < end) {
              int mid = start + ((end - start) >> 1);
              if (nums[mid] == target) {
                  return mid;
              } else if (nums[mid] < target) {
                  start = mid;
              } else {
                  end = mid;
              }
          }
  
          if (nums[start] == target) {
              return start;
          }
          if (nums[end] == target) {
              return end;
          }
          return -1;
      }
masked: public int sample_funcname ( int [ ] var_0 , int var_1 ) {
    if ( var_0 == null || var_0 . length == 0 ) {
      return - 1 ;
    }
    int var_6 = 0 ;
    int var_7 = var_0 . length - 1 ;
    while ( var_6 + 1 < var_7 ) {
      int var_8 = var_6 + ( ( var_7 - var_6 ) >> 1 ) ;
      if ( var_0 [ var_8 ] == var_1 ) {
        return var_8 ;
      }
      else if ( var_0 [ var_8 ] < var_1 ) {
        var_6 = var_8 ;
      }
      else {
        var_7 = var_8 ;
      }
    }
    if ( var_0 [ var_6 ] == var_1 ) {
      return var_6 ;
    }
    if ( var_0 [ var_7 ] == var_1 ) {
      return var_7 ;
    }
    return - 1 ;
  }
  