Scribd Logo
Upload

Welcome to Scribd!

  • 67 views

    C 2 Program

    Uploaded by

    Shahil Singh
    The document discusses Fibonacci series in C programming. It explains that in a Fibonacci series, each number is the sum of the previous two numbers. It then provides code samples to generate a Fibonacci series both with and without recursion in C. The code samples take user input for the number of elements to generate and output the series up to that number.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd

    C 2 Program

    Uploaded by

    Shahil Singh
    67 views6 pages
    The document discusses Fibonacci series in C programming. It explains that in a Fibonacci series, each number is the sum of the previous two numbers. It then provides code samples to generate a Fibonacci series both with and without recursion in C. The code samples take user input for the number of elements to generate and output the series up to that number.

    Original Title

    c2program

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses Fibonacci series in C programming. It explains that in a Fibonacci series, each number is the sum of the previous two numbers. It then provides code samples to generate a Fibonacci series both with and without recursion in C. The code samples take user input for the number of elements to generate and output the series up to that number.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    67 views6 pages

    C 2 Program

    Uploaded by

    Shahil Singh
    The document discusses Fibonacci series in C programming. It explains that in a Fibonacci series, each number is the sum of the previous two numbers. It then provides code samples to generate a Fibonacci series both with and without recursion in C. The code samples take user input for the number of elements to generate and output the series up to that number.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Download as txt, pdf, or txt
    of 6

    Fibonacci Series in C

    Fibonacci Series in C: In case of fibonacci series, next number is the sum of


    previous two numbers for example 0, 1, 1, 2, 3, 5, 8, 13, 21 etc. The first two
    numbers of fibonacci series are 0 and 1.

    There are two ways to write the fibonacci series program:

    Fibonacci Series without recursion


    Fibonacci Series using recursion
    Fibonacci Series in C without recursion
    Let's see the fibonacci series program in c without recursion.

    #include<stdio.h>
    int main()
    {
    int n1=0,n2=1,n3,i,number;
    printf("Enter the number of elements:");
    scanf("%d",&number);
    printf("\n%d %d",n1,n2);//printing 0 and 1
    for(i=2;i<number;++i)//loop starts from 2 because 0 and 1 are already printed
    {
    n3=n1+n2;
    printf(" %d",n3);
    n1=n2;
    n2=n3;
    }
    return 0;
    }
    Output:

    Enter the number of elements:15


    0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
    Fibonacci Series using recursion in C
    Let's see the fibonacci series program in c using recursion.

    #include<stdio.h>
    void printFibonacci(int n){
    static int n1=0,n2=1,n3;
    if(n>0){
    n3 = n1 + n2;
    n1 = n2;
    n2 = n3;
    printf("%d ",n3);
    printFibonacci(n-1);
    }
    }
    int main(){
    int n;
    printf("Enter the number of elements: ");
    scanf("%d",&n);
    printf("Fibonacci Series: ");
    printf("%d %d ",0,1);
    printFibonacci(n-2);//n-2 because 2 numbers are already printed
    return 0;
    } Fibonacci Series in C
    Fibonacci Series in C: In case of fibonacci series, next number is the sum of
    previous two numbers for example 0, 1, 1, 2, 3, 5, 8, 13, 21 etc. The first two
    numbers of fibonacci series are 0 and 1.
    There are two ways to write the fibonacci series program:

    Fibonacci Series without recursion


    Fibonacci Series using recursion
    Fibonacci Series in C without recursion
    Let's see the fibonacci series program in c without recursion.

    #include<stdio.h>
    int main()
    {
    int n1=0,n2=1,n3,i,number;
    printf("Enter the number of elements:");
    scanf("%d",&number);
    printf("\n%d %d",n1,n2);//printing 0 and 1
    for(i=2;i<number;++i)//loop starts from 2 because 0 and 1 are already printed
    {
    n3=n1+n2;
    printf(" %d",n3);
    n1=n2;
    n2=n3;
    }
    return 0;
    }
    Output:

    Enter the number of elements:15


    0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
    Fibonacci Series using recursion in C
    Let's see the fibonacci series program in c using recursion.

    #include<stdio.h>
    void printFibonacci(int n){
    static int n1=0,n2=1,n3;
    if(n>0){
    n3 = n1 + n2;
    n1 = n2;
    n2 = n3;
    printf("%d ",n3);
    printFibonacci(n-1);
    }
    }
    int main(){
    int n;
    printf("Enter the number of elements: ");
    scanf("%d",&n);
    printf("Fibonacci Series: ");
    printf("%d %d ",0,1);
    printFibonacci(n-2);//n-2 because 2 numbers are already printed
    return 0;
    } Write a c program to check palindrome number.

    Input: 329

    Output: not palindrome number

    Input: 12321

    Output: palindrome number


    4) Factorial
    Write a c program to print factorial of a number.

    Input: 5

    Output: 120

    Input: 6

    Output: 720

    5) Armstrong number
    Write a c program to check armstrong number.

    Input: 153

    Output: armstrong
    Fibonacci Series in C
    Fibonacci Series in C: In case of fibonacci series, next number is the sum of
    previous two numbers for example 0, 1, 1, 2, 3, 5, 8, 13, 21 etc. The first two
    numbers of fibonacci series are 0 and 1.

    There are two ways to write the fibonacci series program:

    Fibonacci Series without recursion


    Fibonacci Series using recursion
    Fibonacci Series in C without recursion
    Let's see the fibonacci series program in c without recursion.

    #include<stdio.h>
    int main()
    {
    int n1=0,n2=1,n3,i,number;
    printf("Enter the number of elements:");
    scanf("%d",&number);
    printf("\n%d %d",n1,n2);//printing 0 and 1
    for(i=2;i<number;++i)//loop starts from 2 because 0 and 1 are already printed
    {
    n3=n1+n2;
    printf(" %d",n3);
    n1=n2;
    n2=n3;
    }
    return 0;
    }
    Output:

    Enter the number of elements:15


    0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
    Fibonacci Series using recursion in C
    Let's see the fibonacci series program in c using recursion.

    #include<stdio.h>
    void printFibonacci(int n){
    static int n1=0,n2=1,n3;
    if(n>0){
    n3 = n1 + n2;
    n1 = n2;
    n2 = n3;
    printf("%d ",n3);
    printFibonacci(n-1);
    }
    }
    int main(){
    int n;
    printf("Enter the number of elements: ");
    scanf("%d",&n);
    printf("Fibonacci Series: ");
    printf("%d %d ",0,1);
    printFibonacci(n-2);//n-2 because 2 numbers are already printed
    return 0;
    } Fibonacci Series in C
    Fibonacci Series in C: In case of fibonacci series, next number is the sum of
    previous two numbers for example 0, 1, 1, 2, 3, 5, 8, 13, 21 etc. The first two
    numbers of fibonacci series are 0 and 1.

    There are two ways to write the fibonacci series program:

    Fibonacci Series without recursion


    Fibonacci Series using recursion
    Fibonacci Series in C without recursion
    Let's see the fibonacci series program in c without recursion.

    #include<stdio.h>
    int main()
    {
    int n1=0,n2=1,n3,i,number;
    printf("Enter the number of elements:");
    scanf("%d",&number);
    printf("\n%d %d",n1,n2);//printing 0 and 1
    for(i=2;i<number;++i)//loop starts from 2 because 0 and 1 are already printed
    {
    n3=n1+n2;
    printf(" %d",n3);
    n1=n2;
    n2=n3;
    }
    return 0;
    }
    Output:

    Enter the number of elements:15


    0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
    Fibonacci Series using recursion in C
    Let's see the fibonacci series program in c using recursion.

    #include<stdio.h>
    void printFibonacci(int n){
    static int n1=0,n2=1,n3;
    if(n>0){
    n3 = n1 + n2;
    n1 = n2;
    n2 = n3;
    printf("%d ",n3);
    printFibonacci(n-1);
    }
    }
    int main(){
    int n;
    printf("Enter the number of elements: ");
    scanf("%d",&n);
    printf("Fibonacci Series: ");
    printf("%d %d ",0,1);
    printFibonacci(n-2);//n-2 because 2 numbers are already printed
    return 0;
    } Fibonacci Series in C
    Fibonacci Series in C: In case of fibonacci series, next number is the sum of
    previous two numbers for example 0, 1, 1, 2, 3, 5, 8, 13, 21 etc. The first two
    numbers of fibonacci series are 0 and 1.

    There are two ways to write the fibonacci series program:

    Fibonacci Series without recursion


    Fibonacci Series using recursion
    Fibonacci Series in C without recursion
    Let's see the fibonacci series program in c without recursion.

    #include<stdio.h>
    int main()
    {
    int n1=0,n2=1,n3,i,number;
    printf("Enter the number of elements:");
    scanf("%d",&number);
    printf("\n%d %d",n1,n2);//printing 0 and 1
    for(i=2;i<number;++i)//loop starts from 2 because 0 and 1 are already printed
    {
    n3=n1+n2;
    printf(" %d",n3);
    n1=n2;
    n2=n3;
    }
    return 0;
    }
    Output:

    Enter the number of elements:15


    0 1 1 2 3 5 8 13 21 34 55 89 144 233 377
    Fibonacci Series using recursion in C
    Let's see the fibonacci series program in c using recursion.

    #include<stdio.h>
    void printFibonacci(int n){
    static int n1=0,n2=1,n3;
    if(n>0){
    n3 = n1 + n2;
    n1 = n2;
    n2 = n3;
    printf("%d ",n3);
    printFibonacci(n-1);
    }
    }
    int main(){
    int n;
    printf("Enter the number of elements: ");
    scanf("%d",&n);
    printf("Fibonacci Series: ");
    printf("%d %d ",0,1);
    printFibonacci(n-2);//n-2 because 2 numbers are already printed
    return 0;
    }
    Input: 22

    You might also like