다양한 데이터 구조 공통 작업 3탄 검색

정렬

#include <iostream>
using namespace std;
 
void findElement(int arr[], int N, int K)
{
 
    for (int i = 0; i < N; i++) {
 
        if (arr[i] == K) {
            cout << "Element found!";
            return;
        }
    }
 
    cout << "Element Not found!";
}
 
int main()
{
    int arr[] = { 1, 2, 3, 4 };
 
    int K = 3;
 
    int N = sizeof(arr) / sizeof(arr[0]);
 
    findElement(arr, N, K);
    return 0;
}

스택

#include <bits/stdc++.h>
using namespace std;
 
void findElement(stack<int>& St, int K)
{
 
    while (!St.empty()) {
 
        if (St.top() == K) {
            cout << "Element found!";
            return;
        }
 
        St.pop();
    }
 
    cout << "Element Not found!";
}
 
int main()
{
    stack<int> St;
 
    St.push(4);
    St.push(3);
    St.push(2);
    St.push(1);
 
    int K = 3;
 
    findElement(St, K);
    return 0;
}

대기줄

#include <bits/stdc++.h>
using namespace std;
 
void findElement(queue<int>& Q, int K)
{
 
    while (!Q.empty()) {
 
        if (Q.front() == K) {
            cout << "Element found!";
            return;
        }
 
        Q.pop();
    }
 
    cout << "Element Not found!";
}
 
int main()
{
    queue<int> Q;
 
    Q.push(1);
    Q.push(2);
    Q.push(3);
    Q.push(4);
 
    int K = 3;
 
    findElement(Q, K);
    return 0;
}

링크드리스트

### 정렬

```cpp
#include <iostream>
using namespace std;
 
void findElement(int arr[], int N, int K)
{
 
    for (int i = 0; i < N; i++) {
 
        if (arr[i] == K) {
            cout << "Element found!";
            return;
        }
    }
 
    cout << "Element Not found!";
}
 
int main()
{
    int arr[] = { 1, 2, 3, 4 };
 
    int K = 3;
 
    int N = sizeof(arr) / sizeof(arr[0]);
 
    findElement(arr, N, K);
    return 0;
}
```

### 스택

```cpp
#include <bits/stdc++.h>
using namespace std;
 
void findElement(stack<int>& St, int K)
{
 
    while (!St.empty()) {
 
        if (St.top() == K) {
            cout << "Element found!";
            return;
        }
 
        St.pop();
    }
 
    cout << "Element Not found!";
}
 
int main()
{
    stack<int> St;
 
    St.push(4);
    St.push(3);
    St.push(2);
    St.push(1);
 
    int K = 3;
 
    findElement(St, K);
    return 0;
}
```

### 대기줄

```cpp
#include <bits/stdc++.h>
using namespace std;
 
void findElement(queue<int>& Q, int K)
{
 
    while (!Q.empty()) {
 
        if (Q.front() == K) {
            cout << "Element found!";
            return;
        }
 
        Q.pop();
    }
 
    cout << "Element Not found!";
}
 
int main()
{
    queue<int> Q;
 
    Q.push(1);
    Q.push(2);
    Q.push(3);
    Q.push(4);
 
    int K = 3;
 
    findElement(Q, K);
    return 0;
}
```

### 링크드리스트