FilesExpand file tree

 master

/

binary-search-recursive.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

40 lines (24 loc) · 658 Bytes

 master

/

binary-search-recursive.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

40 lines (24 loc) · 658 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

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

#include <stdio.h>

int binarySearch(int arr[], int left, int right, int key){

if(right >= left){

int mid = left + (right - left) / 2;

if(arr[mid] == key) return mid;

if(arr[mid] > key){

return binarySearch(arr, left, mid - 1, key);

}

return binarySearch(arr, mid + 1, right, key);

}

return -1;

}

int main(void){

int arr[] = {4, 11, 17, 23, 31, 41, 42, 43, 47};

int size = sizeof(arr) / sizeof(arr[0]);

int key = 47;

int index = binarySearch(arr, 0, size - 1, key);

if(index == -1){

printf("The key isn't present in the array. \n");

} else {

printf("Key found at index: %d\n", index);

}

return 0;

}