My-Practice-On-C-/b50.cpp at master · kumaryash7/My-Practice-On-C- · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
// BINARY SEARCH
#include <iostream>
using namespace std;
int binarysearch(int arr[], int n, int key)
{
    int s = 0;
    int e = n;

    while (s <= e)
    {
        int mid = (s + e) / 2;

        if (arr[mid] == key)
        {
            return mid;
        }
        else if (arr[mid] > key)
        {
            e = mid - 1;
        }
        else
        {
            s = mid + 1;
        }
    }
    return 1;
}
int main()
{
    int n;
    cin >> n;
    int arr[n];

    for (int i = 0; i <= n; i++)
    {
        cin >> arr[i];
    }

    int key;

    cin >> key;

    cout << binarysearch(arr, n, key) << endl;

    return 0;
}