All prime numbers
Given an integer N, print all the prime numbers that lie in the range 2 to N (both inclusive).

Print the prime numbers in different lines.

Input Format :

Integer N

Output Format :

Prime numbers in different lines

Constraints :

1

Question

All prime numbers

Given an integer N, print all the prime numbers that lie in the range 2 to N (both inclusive).

Print the prime numbers in different lines.

Input Format :

Integer N

Output Format :

Prime numbers in different lines

Constraints :

1 <= N <= 100

Accepted Answer

You can solve this problem using brute force or sieve of eratosthenes. I solved it using sieve of eratosthenes

Accepted Answer

Space Complexity: Explanation: Time Complexity: Explanation:

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.

Given an integer N, print all the prime numbers that lie in the range 2 to N (both inclusive).

Print the prime numbers in different lines.

Input Format :

Output Format :

Constraints :

Top Indiamart Intermesh Associate Software Engineer interview questions & answers

Popular interview questions of Associate Software Engineer

Top HR questions asked in Indiamart Intermesh Associate Software Engineer