Skip to content

DynamicLinearSearchPointer.cpp

 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
44
45
46
47
#include <stdio.h>
#include <stdlib.h>

int linerSearch(int *arr, int n, int key)
{
    for (int i = 0; i < n; i++)
    {
        if (*(arr + i) == key)
        {
            return i;
        }
    }

    return -1;
}

int main()
{
    int n, key, *arr;

    printf("Enter The Number Of Elements : ");
    scanf("%d", &n);

    arr = (int *)malloc(n * sizeof(int));

    for (int i = 0; i < n; i++)
    {
        printf("Enter The Element %d : ", i + 1);
        scanf("%d", arr + i);
    }

    printf("Enter The Key To Be Searched : ");
    scanf("%d", &key);

    int index = linerSearch(arr, n, key);

    if (index != -1)
    {
        printf("Element Found At Index : %d\n", index);
    }
    else
    {
        printf("Element Not Found\n");
    }

    return 0;
}