binary_search.c
searching Implementation
37 lines731 bytesC
1// Binary Search
2#include <stdio.h>
3
4int binarySearch(int arr[], int left, int right, int key) {
5 while (left <= right) {
6 int mid = left + (right - left) / 2;
7
8 if (arr[mid] == key) {
9 return mid;
10 }
11
12 if (arr[mid] < key) {
13 left = mid + 1;
14 } else {
15 right = mid - 1;
16 }
17 }
18
19 return -1;
20}
21
22int main() {
23 int arr[] = {2, 3, 4, 10, 40, 50, 60};
24 int n = sizeof(arr) / sizeof(arr[0]);
25 int key = 10;
26
27 int result = binarySearch(arr, 0, n - 1, key);
28
29 if (result != -1) {
30 printf("Element found at index %d\n", result);
31 } else {
32 printf("Element not found\n");
33 }
34
35 return 0;
36}
37