FilesExpand file tree

 master

/

binsearch.c

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

25 lines (21 loc) · 534 Bytes

 master

/

binsearch.c

Copy path

Top

File metadata and controls

• Code
• Blame

25 lines (21 loc) · 534 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

#include <stdio.h>

/* binsearch: find x in v[0] <= v[1] <= ... <= v[n-1] */

int binsearch(int x, int v[], int n) {

int low, high, mid;

low = 0;

high = n - 1;

while (low <= high) {

mid = (high + low)/2;

if (x < v[mid])

high = mid - 1;

else if (x > v[mid])

low = mid + 1;

else /* found match */

return mid;

}

return -1; /* no match */

}

void main() {

int A[10] = {0,1,2,3,4,5,6,7,8,9};

printf("%d\n", binsearch(9, A, 10));

}