Search Insert Position [LeetCode]

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Here are few examples.
[1,3,5,6], 5 → 2
[1,3,5,6], 2 → 1
[1,3,5,6], 7 → 4
[1,3,5,6], 0 → 0

Summary: basic binary search stuff.

    int searchInsert(int A[], int n, int target) {
        int start = 0;
        int end = n - 1;
        while(start <= end) {
            int median = start + (end - start + 1) / 2;
            if(target == A[median]) {
                return median;
            }else if(target < A[median]) {
                if(median - 1 >= 0 && target > A[median - 1])
                    return median;
                if(median == 0)
                    return 0;
                end = median - 1;
            }else {
                if(median + 1 <= n - 1 && target < A[median + 1])
                    return median + 1;
                if(median == n - 1)
                    return n;
                start = median + 1;
            }
        }
    }