comefrom: <awangdev>Longest Increasing Subsequence_2.java
code: public int binarySearch(List<Integer> list, int target) {
          int start = 0;
          int end = list.size() - 1;
          while (start + 1 < end) {
              int mid = start + (end - start) / 2;
              if (list.get(mid) == target) {
                  return mid;
              } else if (list.get(mid) < target) {
                  start = mid;
              } else {
                  end = mid;
              }
          }
          return list.get(start) >= target ? start : end;
      }
masked: public int sample_funcname ( List < Integer > var_0 , int var_1 ) {
    int var_2 = 0 ;
    int var_3 = var_0 . size ( ) - 1 ;
    while ( var_2 + 1 < var_3 ) {
      int var_4 = var_2 + ( var_3 - var_2 ) / 2 ;
      if ( var_0 . get ( var_4 ) == var_1 ) {
        return var_4 ;
      }
      else if ( var_0 . get ( var_4 ) < var_1 ) {
        var_2 = var_4 ;
      }
      else {
        var_3 = var_4 ;
      }
    }
    return var_0 . get ( var_2 ) >= var_1 ? var_2 : var_3 ;
  }
  