Program of prim number series using recursion in c

Write a program to generate list of prim number up to n, where n being entered by user.

                               

In this post we shall learn how to generate prim number series using recursion in c language. the limit of series shall be entered by user i.e. n number series of prim number.

Example :

prim number series of 4 number(element) = 2 , 3 , 5 , 7

 Now see the program:

#include<stdio.h>
#include<conio.h>
void primeSeries(int);
int main()
{
    int limit;
    printf("Enter the limit of prime number series\t");
    scanf("%d",&limit);
    printf("\n\t2");
    primeSeries(limit);
}
void primeSeries(int n)
{
    static int a = 3;
    int i,flag = 0;
    if(n == 1)
    {
        printf("\nSeries ends here");
    }
    else
    {
        for(i = 2; i <= a-1; i++)
        {
            if(a%i != 0)
            {
                flag = 1;
            }
            else
            {
                flag = 0;
                break;
            }
        }
        if(flag)
        {
            printf("\n\t%d",a);
            a++;
            primeSeries(n - 1);
        }
        else
        {
            a++;
            primeSeries( n);
        }
    }
}

Output:

  Enter the limit of prime number series 7
                    2
                    3
                    5
                    7
                    11
                    13
                    17
       Series ends here


Do not forget to subscribe me for latest update on my blog , follow me and grow your knowledge. thank you

Read More

Program in c using recurion to know the number is a prim or not

Write a program to check if the entered number is a prim number or not using recursion in c.

In this post we shall learn through a program in c using recursion that the entered number is a prim number or not. The number will be entered by user and program display the out put that the number is prim or not.

Example:

Entered number = 13

Output = Number is prim.

Now see the program:

#include<stdio.h>
#include<conio.h>
int checkPrime(int);
int main()
{
    int number,flag = 0;
    printf("Enter number\t");
    scanf("%d",&number);

    if(number == 2)
    {
        printf("The number is prime\n");
    }
    else if(number < 2)
    {
        printf("The smallest prime number is 2\n");
    }
    else
    {
        flag = checkPrime(number);
        if(flag)
        {
            printf("Number is prime\n");
        }
        else
        {
            printf("Not prime");
        }
    }
}
int checkPrime(int x)
 {
      static int n = 2, flag1 = 1;
      if(n == x)
      {
          return 0;
      }
      else if(x%n == 0)
          {
              flag1 = 0;
              n++;
          }
          else
          {
            n++;
            flag1 = 1;
            checkPrime(x);
          }
      return(flag1);
}

Output:

Enter number  29
Number is prim.

Do not forget to subscribe me for latest update on my blog , follow me and grow your knowledge. thank you

Read More

How to calulate power of an integer number using recursion in c

Write a program in c using recursion to calculate the power of an inter number. The number and power will be entered by user.

 

In this program we shall learn through a program that how to calculate power of an integer number using recursion in c programming language. In this program ask for a number and power to be calculated to the user, and display the corresponding value of the power of number.

Example:

Enter number = 5

Enter power  = 3

Calculated value = 125

Now see the program:

#include<stdio.h>
#include<conio.h>
int Power(int,int);
int main()
{
    int number,power,result;
    printf("Enter number\t");
    scanf("%d",&number);
    printf("Enter the power to be calculated\t");
    scanf("%d",&power);
    result = Power(number,power);
    printf("The result of %d to the power %d is = %d\n",number,power,result);
}
int Power(int a,int b)
{
    static int r = 1;
    if(b == 0)
    {
        return(1);
    }
    else
    {
        r = r*a;
        Power(a,b-1);
    }
    return(r);
}

Output:

Enter number = 6
Enter the power to be calculated = 2
The result of  6 to the power 2 is  = 36

Do not forget to subscribe me for latest update on my blog , follow me and grow your knowledge. thank you

 

Read More

How to reverse a number using recursion in c

Write a program to print the reverse of an integer number. Number entered by user using recursion.

 

In this post we shall learn how to revers a number using recursion in c programming.In this we shall write a program that take an input integer value from user and display the reverse of the entered number.

Example:

  user entered number  = 123456

  output of program      = 654321.

Now see the program: 

#include<stdio.h>
#include<conio.h>
int reversenumber(int);
int main()
{
    int number,result;
    printf("Enter Number\t");
    scanf("%d",&number);
    result = reversenumber(number);
    printf("The reverse of number %d is = %d",number,result);
}
int reversenumber(int n)
{
    int x;
    static int r = 0;
    if(n == 0)
    {
        return(n);
    }
    else
    {
        x = n%10;
        r = r*10 + x;
        reversenumber(n/10);
    }
    return(r);
}

Output:

   Enter Number   456123
  The reverse of number 456123 is = 321654.


Do not forget to subscribe me for latest update on my blog , follow me and grow your knowledge. thank you

Read More

Program to generate Fibonacci series using recursion in c

Write a program to generate Fibonacci series. The user enter the limit of series.

 

 

This post contains a program in c that program will generate the Fibonacci series. The limit of Fibonacci series element will be entered by user. as we know the Fibonacci series is the sum of the two preceding number of the series .

i.e. 1, 1, 2, 3, 5, 8, 13, 21, ........known as Fibonacci series.

Now see the program:

#include<stdio.h>

#include<conio.h>

void fiboseries(int);

int main()

{

    int limit,first = 0,second = 1;

    printf("Enter the limit of Fibonacci series\t");

    scanf("%d",&limit);

    if(limit > 2)

    {

        printf("%d\t%d",first,second);

        fiboseries(limit - 2);

    }

    else if(limit == 2)

    {

        printf(" %d\t%d",first,second);

    }

    else if(limit == 1)

    {

        printf("\t%d",second);

    }

    else

    {

        printf("\nSeries not possible");

    }

}

void fiboseries(int x)

{

    int fibo;

    static int first = 0,second = 1;

    if(x == 0)

    {

        printf("\nSeries displayed above");

    }

    else

    {

        fibo = first + second;

        first = second;

        second = fibo;

        printf("\t%d",fibo);

        fiboseries(x-1);

    }

}

Output:

Enter the limit of Fibonacci series  5

                 1

                 1 

                 2

                 3

                 5

Series displayed above

Do not forget to subscribe me for latest update on my blog , follow me and grow your knowledge. thank you

 

Read More

How to calculate nth number of fibonacci series

Write a program to calculate nth number of the Fibonacci  series.

 

 

In this post we shall write a program in c that calculate the nth number of the Fibonacci series.In that program user will enter the position of the element and the program will display the corresponding number of Fibonacci series .

As we know the Fibonacci series is  = 1, 1, 2, 3, 5, 8, 13, 21, ........ 

each number is the sum of the  two preceding numbers.

 Now see the program

#include<stdio.h>
#include<conio.h>
int fibnum(int);
int main()
{
    int position ,result;
    printf("Enter the position of element you want to print from Fibonacci series\t");
    scanf("%d",&position);
    result = fibnum(position);
    printf("The required fibonacci number is  = %d",result);
}
int fibnum(int n)
{
    if(n == 0 || n == 1)
    {
        return(n);
    }
    else
    {
        return(fibnum(n - 1) + fibnum(n - 2));
    }
}
 

Output: 

Enter the position of element you want to print from Fibonacci series 7

The required Fibonacci number is = 13.

Do not forget to subscribe me for latest update on my blog , follow me and grow your knowledge. thank you

Read More

How to calculate factorial of a number using recursion

Write a program to calculate factorial of a number . Number being entered by user.

In this post we shall learn how to calculate factorial of a number through a program written in c
In this program user will enter a number (integer value) and program will display the corresponding factorial of the entered number.
As we know the factorial of n is  = n(n-1)(n-2)(n-3).........3.2.1.

now see the program

#include<stdio.h>
#include<conio.h>

int factorial(int);
int main()
{
 int number,result;
 printf("Enter a number\t");
 scanf("%d",&number);
 result = factorial(number);
 printf("\n The factorial of %d is = %d",number,result);
}
int factorial(int n)
{
    if(n == 0 || n == 1)
    {
        return(1);
    }
    else
    {
        return(n*factorial(n-1));
    }
}

Output:

Enter a number  5
The factorial of 5 is = 120


  Do not forget to subscribe me for latest update on my blog , follow me and grow your knowledge. thank you




 

Read More