Search Insert Position

    public int searchInsert(int[] A, int target) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(A.length == 0) return 0;
        int start = 0;
        int end = A.length - 1;
        int middle = 0;
        while(start <= end) {
            middle = start + (end - start) / 2;
            if(A[middle] == target) return middle;
            else if(A[middle] > target) end = middle - 1;
            else start = middle + 1;
        }
        return start;
    }