In this program, You will learn how to find prime numbers in an array in C++.

`Some list of prime numbers is: 2 3 5 7 11 13 17`

## Example: How to find prime numbers in an array in C++.

```
#include<iostream>
using namespace std;
int main() {
int arr[10], i, s, j, p;
cout << "Enter size of an array:";
cin>>s;
cout << "Enter array elements:";
for (i = 0; i < s; i++) {
cin >> arr[i];
}
cout << "All prime list:";
for (i = 0; i < s; i++) {
j = 2;
p = 1;
while (j < arr[i]) {
if (arr[i] % j == 0) {
p = 0;
break;
}
j++;
}
if (p == 1) {
cout << arr[i] << " ";
}
}
return 0;
}
```

#### Output:

```
Enter size of an array:5
Enter array elements:3 4 5 6 7
All prime list:3 5 7
```