Pseudocode for all prime numbers

#1

Psuedocode to print all prime numbers in the range 1 to N. sir can you write it for me? I tried but for this question I didn’t understand

#2

Ok
Think like this
Iterate over every element from 1 to N
For every element let’s say x check if it is prime or not by checking it’s divisibility . If not divisible by anyone except 1 and no itself print it

#3

sir I don’t understand the psuedocode code to write it in correct form please help me with that

#4

I didn’t understand the psuedocode sir can you send me for this question

#5

Ok refer this in this you have to print n to m just do same but 1 to n
http://cssimplified.com/c-cpp-programming-data-structure/design-an-algorithm-and-draw-corresponding-flowchart-to-find-all-the-prime-numbers-between-two-given-numbers-m-and-n-where-m-n-0-10m-dec2005