Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Prodentim Probiotics Specially Designed For The Health Of Your Teeth And Gums

Instant Grammar Checker - Correct all grammar errors and enhance your writing

Teach Your Child To Read

Powerful WordPress hosting for WordPress professionals

Disclosure: My content contains affiliate links.

31,166 questions

40,722 answers

573 users

How to find the max prime number in an array with C++

1 Answer

0 votes
#include <iostream>
#include <cmath>
 
using namespace std;
 
bool isPrime(int n) {
    if (n == 0) return 0;
    if (n == 1) return 0;
    for (int i = 2; i <= sqrt(n); i++) {
        if (n % i == 0)
            return 0;
    }
    return 1;
} 
 
int main() {
    int arr[] = {4, 8, 17, 5, 9, 22, 21, 13, 18, 99};
    int len = sizeof(arr) / sizeof(int), max = arr[0];
  
    for (int i = 0; i < len; i++) {
       if (isPrime(arr[i])) { // 17 5 13
           if (max < arr[i]) { 
               max = arr[i];
           }
        }
    }
    cout << max;
}

 
 
/*
run:
 
17
 
*/

 





answered Oct 18, 2019 by avibootz
edited Oct 18, 2019 by avibootz

Related questions

1 answer 90 views
1 answer 74 views
1 answer 70 views
1 answer 83 views
1 answer 98 views
...