Data-Structures-And-Algorithms/binary_search_using_loops.cpp at master · KISHOREMUTHU/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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
# Data-Structures-And-Algorithms
Here I will post my regular DSA problems

// Binary Search using loops

#include<iostream>

#include<string.h>

using namespace std;


class bin_search{

    int a[100],n,l,r,mid,key;

    public:

    void getdata (); // Getting the input sorted array

    void display ();

    };

  void bin_search::getdata(){


        cin>>n;

      for(int i=0;i<n;i++){

          cin>>a[i];
                          }

        cin>>key;

        }

  void bin_search:: display (){

       l=0;

       r=n-1;

     // Process takes place here

    while(l<=r){

         mid=(l+r)/2;

         if(a[mid]==key){

            cout<<mid;

            break;}

         else if(a[mid]<key){

             l=mid+1;}

         else{

              r=mid-1;}

            }

            }


  int main(){

      bin_search b;

      b.getdata();

      b.display();

       return 0;

       }