-using doubly nested loop.. int main() { // define isPrime of bool to remember i
ID: 3628650 • Letter: #
Question
-using doubly nested loop..int main()
{
// define isPrime of bool to remember if a number is prime or not
// Outter loop: take i from 2 to 100
// Assume i is prime at first
// Inner loop: check to see if i is prime
// try to divide i by number j from 2 to i/2
// if divided evenly (no remainder)
// remember i not prime (unnecessary to divide by next)
// end of inner loop
// if it's prime, output i
// end of outter loop
}
========================================================================
sample output:
Enter n - show prime numbers less than n: 100
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97
Try again? (y/n) y
Enter n - show prime numbers less than n: 20
2 3 5 7 11 13 17 19
Try again? (y/n) y
Enter n - show prime numbers less than n: 200
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97
101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191
193 197 199
Try again? (y/n) n
Explanation / Answer
// sorry some logic missed
// now working fine.........
#include<iostream>
using namespace std;
bool isprime(int number)
{
if(number == 2) return true;
int main()
{
char ch;
int n;
do
{
cout << "Enter n - show prime numbers less than n: " << endl;
cin >> n;
for(int i=2; i<n; i++)
{
if(isprime(i))
cout << i << " ";
}
cout << "Try again? (y/n) " <<endl;
cin >>ch;
} while(ch=='y');
return 0;
}
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.