legendary-octo-couscous/2.cpp at master · nayan-coder/legendary-octo-couscous · GitHub

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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include <iostream>

using namespace std;

int search(int arr[], int n, int item)
{
    int i;
    for (i = 0; i < n; i++)
        if (arr[i] == item)
            return i;
    return -1;

}

int main()
{
    int n,i;
    int item;
    cout<<"Enter Size of Array:";
    cin>>n;
    int * arr = new int;
    cout<<"Enter Elements";
    for(i=0;i<n;i++)
        cin>>arr[i];
    cout<<"Enter the element to be searched";
    cin>>item;
    int result = search(arr, n, item);
    if(result == -1)
        cout<<"Element is not present in array";
    else
        cout<<"Element is present at index: " <<result;
    return 0;
}
#include <iostream>

using namespace std;

int search(int arr[], int n, int item)
{
    int i;
    for (i = 0; i < n; i++)
        if (arr[i] == item)
            return i;
    return -1;

}

int main()
{
    int n,i;
    int item;
    cout<<"Enter Size of Array:";
    cin>>n;
    int * arr = new int;
    cout<<"Enter Elements";
    for(i=0;i<n;i++)
        cin>>arr[i];
    cout<<"Enter the element to be searched";
    cin>>item;
    int result = search(arr, n, item);
    if(result == -1)
        cout<<"Element is not present in array";
    else
        cout<<"Element is present at index: " <<result;
    return 0;
}