class MySorted2 { private long[] a; private int nElem; public MySorted2(int size){ a=new long[size]; nElem=0; } public void insert(long v){ int j; for(j=0; jv) break; for(int k=nElem; k>j; k--) a[k]=a[k-1]; a[j]=v; nElem++; } public void display(){ for(int j=0; jupper) return nElem; if(a[curIn]>v) upper=curIn-1; else lower=curIn+1; } } public boolean delete(long v){ int j; for(j=0; j