Question

Write a program to print all the prime numbers below a certain given number. A prime number is defined as a number that can only be divided by 1 and itself.

Requirements:

1. Accept the upper limit from the user as an integer.

2. You can assume the user input will be positive and smaller than INT MAX

3. Go from 1 to the number. If you happen to find a number that is prime, print it. The input and output should match the sample run.

Please try and restrict yourself to loops, selection statements, and calls to library methods

Sample Run:

Enter the upper limit: 25

The prime numbers are:

2, 3, 5, 7, 11, 13, 17, 19, 23

Answer 1

#include<bits/stdc++.h>
using namespace std;

void printPrimes(int n) {
int i = 2;
while(i <= n) {
bool isPrime = true;
for(int j = 2; j < i-1; j++) {
if(i%j == 0){
isPrime = false;
break;
}
}
if(isPrime) cout << i << " ";
i++;
}
cout << endl;
}

int main() {
int n;
cout << "Enter a number for range ::";
cin >> n;
printPrimes(n);
return 0;
}