Prime Numbers within a Range

Given an integer N, determine and print all the prime numbers between 2 and N, inclusive.

Input:

Integer N

Output:

Prime numbers printed on separate lines

Example:

Input:

N = 10

Output:

2 3 5 7

Constraints:

1

Question

Prime Numbers within a Range

Given an integer N, determine and print all the prime numbers between 2 and N, inclusive.

Input:

Integer N

Output:

Prime numbers printed on separate lines

Example:

Input:

N = 10

Output:

Constraints:

1 <= N <= 100

Note:

Ensure that the output is formatted with each prime number on a new line.

Accepted Answer

Generate and print all prime numbers between 2 and N, inclusive.

Iterate from 2 to N and check if each number is prime
A prime number is only divisible by 1 and itself
Print each prime number on a new line

Accepted Answer

step 1: Take a Boolean vector initialize all the position with true

step 2: Now iterate the outer loop from i=2 to sqrt of n

step 3: when u got arr[i]=true means this is a prime number so all the multiples of this number i is not prime right e.g. prime:2 ,multiples of 2 is: 4,6,8,10 etc are not prime.

step4: In inner for loop make all these multiples false.

This way you mark all the non-prime number false. Hence all number which is true are prime except 1.