public int searchInsert(int[] A, int target) {
		int idx = -1;
        for(int i=0;i<A.length;i++){
        	if(target==A[i]){
        		return i;
        	}
        	/*else if(target <A[i+1] && target>A[i]){
        		
        	}*/else if(target <A[i]){
        		idx=i;
        		return idx;
        	}
        }
        if(idx==-1){
        	idx=A.length;
        }
		return idx;
    }