leetcode/src/35.cpp at main · kaanoz1/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
    int min = 0;
    int max = nums.size() - 1;

    while (min <= max) {
        int n = max - min + 1;
        int i = min + (n / 2);
        int el = nums[i];

        if (el == target) return i;

        if (el < target) min = i + 1;
         else max = i - 1;

    }
    return min;
    }
};