int searchInsert(int A[], int n, int target)//Search Insert Position
{
if(n==0||A==NULL) return 0;
int index;
for (int i=0;i<n;i++)
{
if(i==0&&A[i]>target) return 0;
if(i==n-1&&A[i]<target) return n;
if (A[i]==target)
{return i;
}
else if (A[i]<target&&A[i+1]>target)
{return i+1;
}
}
}