261. Where Would It Go

Given n distinct integers in increasing order and a value x, print the index where x is, or where it would have to be inserted to keep the array sorted.

1 3 5 6 x = 5 -> 2 (it is there) 1 3 5 6 x = 2 -> 1 (it would go between 1 and 3) 1 3 5 6 x = 7 -> 4 (it would go at the end)

You have already written this. It is exactly the lower bound from problem 241, and seeing that the two questions are the same question is the point of having both.

Constraints - `1 ≤ n ≤ 200000` - `-1000000000 ≤ a[i] ≤ 1000000000` - All values are distinct and increasing.