void add(int n){
  if (v == null) {
    v=new int[INIT_SIZE];
    v[0]=n;
    len=1;
    return;
  }
  if (len == v.length) {
    int[] newv=new int[len * 2];
    System.arraycopy(v,0,newv,0,len);
    v=newv;
  }
  if (n > v[len - 1]) {
    v[len++]=n;
    return;
  }
  int i=0;
  for (; i < len; i++) {
    if (n <= v[i]) {
      if (n == v[i])       return;
      break;
    }
  }
  for (int j=len; j >= i; j--)   v[j + 1]=v[j];
  v[i]=n;
  ++len;
}

void add ( int n ) { if ( v == null ) { v = new int [ INIT_SIZE ] ; v [ 0 ] = n ; len = 1 ; return ; } if ( len == v . length ) { int [ ] newv = new int [ len * 2 ] ; System . arraycopy ( v , 0 , newv , 0 , len ) ; v = newv ; } if ( n > v [ len - 1 ] ) { v [ len ++ ] = n ; return ; } int i = 0 ; for ( ; i < len ; i ++ ) { if ( n <= v [ i ] ) { if ( n == v [ i ] ) return ; break ; } } for ( int j = len ; j >= i ; j -- ) v [ j + 1 ] = v [ j ] ; v [ i ] = n ; ++ len ; }
add a new value .
