comefrom: <gouthampradhan>binary_search_SearchInsertPosition_1.java
code: public int searchInsert(int[] nums, int target) {
      int pos = nums.length;
      int s = 0, e = nums.length - 1;
      while (s <= e) {
        int m = s + (e - s) / 2;
        if (nums[m] >= target) {
          pos = m;
          e = m - 1;
        } else s = m + 1;
      }
      return pos;
    }
masked: public int sample_funcname ( int [ ] var_0 , int var_1 ) {
    int var_3 = var_0 . length ;
    int var_5 = 0 , var_7 = var_0 . length - 1 ;
    while ( var_5 <= var_7 ) {
      int var_9 = var_5 + ( var_7 - var_5 ) / 2 ;
      if ( var_0 [ var_9 ] >= var_1 ) {
        var_3 = var_9 ;
        var_7 = var_9 - 1 ;
      }
      else var_5 = var_9 + 1 ;
    }
    return var_3 ;
  }
  