Question

Find all the prime numbers which are less than a given number n in c++

Answer 1

Hey there,
Here is your answer ⤵⤵⤵


// C++ program to print all primes

// less than N

#include <bits/stdc++.h>

using namespace std;

// function check whether a number

// is prime or not

bool isPrime(int n)

{

    // Corner case

    if (n <= 1)

        return false;

// Check from 2 to n-1

    for (int i = 2; i < n; i++)

        if (n % i == 0)

            return false;

return true;

}

// Function to print primes

void printPrime(int n)

{

    for (int i = 2; i <= n; i++) {

        if (isPrime(i))

            cout << i << " ";

    }

}

// Driver Code

int main()

{

    int n = 7;

    printPrime(n);

}

#Be brainly
Mark as brainliest
Follow me