C++ Program for Prime Number Between 1 to n

 

1. C++ Program for Prime Number Between 1 to n

In this program, we will ask the user to enter the starting and the ending number so that the compiler will fetch and prints all the prime numbers between those intervals.

C++

1

//Learnprogramo - programming made simple

2

#include <iostream>

3

using namespace std;

4

int main()

5

{

6

    int low, high, i, flag;

7

    cout << "Enter two numbers(intervals): ";

8

    cin >> low >> high;

9

    cout << "Prime numbers between " << low << " and " << high << " are: ";

10

    while (low < high)

11

    {

12

        flag = 0;

13

        for(i = 2; i <= low/2; ++i)

14

        {

15

            if(low % i == 0)

16

            {

17

                flag = 1;

18

                break;

19

            }

20

        }

21

        if (flag == 0)

22

            cout << low << " ";

23

        ++low;

24

    }

25

    return 0;

26

}

Output:

In the above program, the lower interval is assigned to variable low and the highest interval is assigned to the high. So in the output, we have given low as 1 and the high as 10 and the compiler have printed all the prime numbers between 1 and 10.

2. C++ Program for Prime Number Between 1 to n Using Functions

In this program, we will declare a user-defined function to print all the prime numbers between 1 and n.

C++

1

//Learnprogramo - programming made simple

2

#include <iostream>

3

using namespace std;

4

int isPrimeNumber(int);

5

int main() {

6

   bool isPrime;

7

   int count;

8

   cout<<"Enter the value of n:";

9

   cin>>count;

10

   for(int n = 2; n < count; n++)

11

   {

12

       // isPrime will be true for prime numbers

13

       isPrime = isPrimeNumber(n);

14

       if(isPrime == true)

15

          cout<<n<<" ";

16

   }

17

   return 0;

18

}

19

// Function that checks whether n is prime or not

20

int isPrimeNumber(int n) {

21

   bool isPrime = true;

22

   for(int i = 2; i <= n/2; i++) {

23

      if (n%i == 0)

24

      {

25

         isPrime = false;

26

         break;

27

      }

28

   }

29

   return isPrime;

30

}

Output:

After compiling the above program we have given the input n as 15 so the compiler has printed all the prime numbers up to 15.

3. Print Prime Numbers When Greatest Number is Entered first

In this program, we will first give inputs lowest and greatest number between which we want to print all prime numbers.

C++

1

//Learnprogramo - programming made simple

2

#include <iostream>

3

using namespace std;

4

int main()

5

{

6

    int low, high, flag, temp;

7

    cout << "Enter two numbers(intevals): ";

8

    cin >> low >> high;

9

    //swapping numbers if low is greater than high

10

    if (low > high) {

11

        temp = low;

12

        low = high;

13

        high = temp;

14

    }

15

    cout << "Prime numbers between " << low << " and " << high << " are: ";

16

    while (low < high)

17

    {

18

        flag = 0;

19

        for(int i = 2; i <= low/2; ++i)

20

        {

21

            if(low % i == 0)

22

            {

23

                flag = 1;

24

                break;

25

            }

26

        }

27

        if (flag == 0)

28

            cout << low << " ";

29

        ++low;

30

    }

31

    return 0;

32

}

Output:

4. Printing all Prime Numbers Between 1 and 100

In this program we will print all the prime numbers between 1 and 100.

C++

1

//Learnprogramo - programming made simple

2

#include <iostream>

3

using namespace std;

4

int isPrimeNumber(int);

5

int main()

6

{

7

   bool isPrime;

8

   for(int n = 2; n < 100; n++) {

9

      // isPrime will be true for prime numbers

10

      isPrime = isPrimeNumber(n);

11

      if(isPrime == true)

12

         cout<<n<<" ";

13

   }

14

   return 0;

15

}

16

// Function that checks whether n is prime or not

17

int isPrimeNumber(int n) {

18

   bool isPrime = true;

19

   for(int i = 2; i <= n/2; i++) {

20

      if (n%i == 0) {

21

         isPrime = false;

22

         break;

23

      }

24

   }  

25

   return isPrime;

26

}

Output: