Mode:
Duration:
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
41
42
43
#include <stdio.h>
int main() {
int arr[] = {10, 25, 30, 45, 60};
int n = 5;
int key = 30;
int i, found = 0;
// Linear Search
for (i = 0; i < n; i++) {
if (arr[i] == key) {
printf("Element found at index %d\n", i);
found = 1;
break;
}
}
if (!found)
printf("Element not found\n");
// Binary Search (only works on sorted array)
int low = 0, high = n - 1, mid;
found = 0;
while (low <= high) {
mid = (low + high) / 2;
if (arr[mid] == key) {
printf("Binary Search: Found at index %d\n", mid);
found = 1;
break;
} else if (arr[mid] < key) {
low = mid + 1;
} else {
high = mid - 1;
}
}
if (!found)
printf("Binary Search: Element not found\n");
return 0;
}Coding works best on desktop or with an external keyboard.