PLAY WITH CODING

Home Basic Program If & Else Loops Conversion Pattern logo

Program Based on Loops

Program to print second largest prime number in a given range

Input - Output

Input
Enter the range to find second largest prime number : 4 15

Output
Second largest prime number between 4 and 15 are : 11

Algorithm

Step 1: START

Step 2: Declare variable num1,num2,flag and count=0;

Step 3: Input range from user and store it into num1 and num2.

Step 4: Now we have to check each number from low limit number to upper limit number one by one if it is found prime then increment count by 1.

if count==2 then stop the iteration.

Logic :

first for Loop for range incease lower limit by 1 in eacch iteration

second for Loop for check it is prime or not

Step 5: for(int i=num1;i<num2;++i) {

      flag = 0 ;

      for(int j=2;j<=num/2;j++){

           if( i % j == 0){

           flag=1

            break; }

          }

      if flag == 0 && i != 1

        count ++ ;

      if count == 2 {

        print i;

    break ; }

   }

Step 6: END

CODE


/* Print second largest prime number in a given range */

#include<stdio.h>
int main()
{
      int num1,num2,flag,count=0;
      printf(" Enter the range to find second largest prime number : ");
      scanf("%d%d",&num1,&num2);
      printf(" Second largest prime number between %d and %d are : ",num1,num2);
      for(int i=num2-1;i>num1;i--)
    {
        flag=0;
        for(int j=2;j<=i/2;++j)
      {
          if(i % j == 0)
        {
            flag=1;
            break;
        }
      }
        if(flag == 0 && i > 1)
        count++;
        if(count == 2)
       {
          printf("%d",i);
          break;
       }
     }
    return 0;
}


/* Print second largest prime number in a given range */

#include<iostream>
using namespace std;
int main()
{
      int num1,num2,flag,count=0;
      cout<<" Enter the range to find second largest prime number : ";
      cin>>num1>>num2;
      cout<<" Second largest prime number between "<<num1<<" and "<<num2<<" are : ";
      for(int i=num2-1;i>num1;i--)
    {
        flag=0;
        for(int j=2;j<=i/2;++j)
      {
          if(i % j == 0)
        {
            flag=1;
            break;
        }
      }
        if(flag == 0 && i > 1)
        count++;
        if(count == 2)
       {
          cout<<i;
          break;
       }
     }
    return 0;
}

OutPut

Enter the range to find second largest prime number : 4 15

Second largest prime number between 4 and 15 are : 11

Recommendation

1. Basic C program.
2. Program based on If - Else
3. Program based on Loops
4. Program based on Conversion
5. Program based on Pattern