Search Insert Position

Search Insert Position

  Total Accepted: 26622  Total Submissions: 76002 My Submissions

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

//Search Insert Position

#include<iostream>

using namespace std;

class Solution {
public:
    int searchInsert(int A[], int n, int target) {
		int i = 0;
		while(A[i] < target && i < n)
		{
			++i;
		}
		return i;
    }
};

int
main(void)
{
	Solution sn;
	int arr[] = {1};
	int n = 1;
	int tgt;
	cin >> tgt;
	cout << sn.searchInsert(arr,n,tgt);
	return 0;
}