【LeetCode】Search Insert Position

class Solution {public:    int searchInsert(int A[], int n, int target) {        int first, end,mid,value,result;first = 0; end = n ;while (first < end){mid = first + (end - first) / 2;int value = A[mid];if (target == value)return mid;else if (target>value){first = mid + 1;result = first;}else{end = mid;result = end;}}return result;    }};