[LeetCode] Search Insert Position

class Solution {
public:
int searchInsert(int A[], int n, int target) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int s = 0;
int t = n - 1;

while (s <= t) {
int p = (s + t) / 2;

if (A[p] == target)
return p;
else if (A[p] < target)
s = p + 1;
else
t = p - 1;
}

return s;
}
};