APCS 2021/11

1
2
3
4
5
6
7
8
9
10
11
12

int a[8] = { 2, 4, 7, 10, 40 } ;
int binary_search( int a[] , int le , int r, int x) {
    if( le < r ) {
        int mid = ( le + r ) / 2 ;
        if(a[ mid ] == x)
            return mid ;
        else if( x < a[ mid ] )
            return binary_search( a, le, mid, x) ;
        return binary_search( a, mid+1, r, x) ;
    }
    return -1 ;
}