summaryrefslogtreecommitdiff
path: root/Year_1/Programming_2/algorithms/binarysearch.cc
blob: c9b4cd7e782c215c0e2f4ade8d62eea6662769f9 (plain)
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
#include<iostream>

using namespace std;

bool bs(int a[], int i, int j, int x) {
    if(j<i) return false;
    int mid = i+(j-i)/2;
    if(a[mid] == x)
        return true;
    if(a[mid] > x)
        return bs(a, i, mid-1, x);
    return bs(a, mid+1, j, x);
}

bool bs2(int a[], int i, int j, int x) {
    while(i <= j) {
        int mid = i+(j-i)/2;
        if(a[mid] == x) return true;
        if(a[mid] < x)
            i = mid+1;
        else
            j = mid-1;
    }
    return false;
}

int main() {
    int a[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
    for(int i = 0; i < 12; ++i)
        cout << i << ' '<<bs(a, 0, 9, i) << ' ' << bs2(a, 0, 9, i) << endl;
    return 0;
}