Data-Structures-and-Algorithms-/Binary_Search.cpp at master · ItsOnkar-dev/Data-Structures-and-Algorithms- · 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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
/******************************************************************************

                              Online C++ Compiler.
               Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.

*******************************************************************************/

/******************************************************************************

                              Online C++ Compiler.
               Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.

*******************************************************************************/

#include <iostream>

using namespace std;

int main()
{
    int i,num,num1;

    cout<<"Enter the size of an array"<<endl;
    cin>>num;

    int arr[num];

    cout<<"Enter the elements of an array\n";

    for (i = 0; i<num; i++)
    {
        cout <<"arr [" << i << "] = ";
        cin>>arr[i];
    }

    cout<<"Enter the element which you want to search for:\n";
    cin>>num1;

    int start = 0, end = num-1;

    while(start<=end)
    {
    int mid = start + end / 2;

    if (arr[mid] == num1)
    {
        cout<<"Element "<<num1<<" Found in the given array at index "<<mid;
        break;
    }

    else if (arr[mid] > num1)
    {
        end = mid - 1;
    }

    else if (arr[mid] < num1)
    {
        start = mid + 1;
    }
    }

    return 0;
}