linear_search.c

searching Implementation

28 lines
529 bytes
C
1// Linear Search
2#include <stdio.h>
3
4int linearSearch(int arr[], int n, int key) {
5    for (int i = 0; i < n; i++) {
6        if (arr[i] == key) {
7            return i;
8        }
9    }
10    return -1;
11}
12
13int main() {
14    int arr[] = {10, 23, 45, 70, 11, 15};
15    int n = sizeof(arr) / sizeof(arr[0]);
16    int key = 70;
17    
18    int result = linearSearch(arr, n, key);
19    
20    if (result != -1) {
21        printf("Element found at index %d\n", result);
22    } else {
23        printf("Element not found\n");
24    }
25    
26    return 0;
27}
28