Scribd Logo
Upload

Welcome to Scribd!

  • 40 views

    Ans - Function in C: Q.13-Define The Function. and Explain With Example of Recursion

    Uploaded by

    Dharmendra Gurjar
    The document defines functions and recursion in C. It states that a function is a block of code that performs a specific task, and that all C programs have at least one function, the main() function. Functions are used to divide large programs into modules for easier debugging and maintenance. There are two types of functions: library/predefined functions and user-defined functions. Recursion is when a function calls itself, either directly or indirectly. Recursive functions can be used to solve problems like calculating factorials or generating Fibonacci sequences. Examples are given of recursive functions to find the factorial of a number and of call by value and call by reference.

    Copyright:

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

    Ans - Function in C: Q.13-Define The Function. and Explain With Example of Recursion

    Uploaded by

    Dharmendra Gurjar
    40 views4 pages
    The document defines functions and recursion in C. It states that a function is a block of code that performs a specific task, and that all C programs have at least one function, the main() function. Functions are used to divide large programs into modules for easier debugging and maintenance. There are two types of functions: library/predefined functions and user-defined functions. Recursion is when a function calls itself, either directly or indirectly. Recursive functions can be used to solve problems like calculating factorials or generating Fibonacci sequences. Examples are given of recursive functions to find the factorial of a number and of call by value and call by reference.

    Original Description:

    For bsc 1 year

    Original Title

    Function

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document defines functions and recursion in C. It states that a function is a block of code that performs a specific task, and that all C programs have at least one function, the main() function. Functions are used to divide large programs into modules for easier debugging and maintenance. There are two types of functions: library/predefined functions and user-defined functions. Recursion is when a function calls itself, either directly or indirectly. Recursive functions can be used to solve problems like calculating factorials or generating Fibonacci sequences. Examples are given of recursive functions to find the factorial of a number and of call by value and call by reference.

    Copyright:

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

    Ans - Function in C: Q.13-Define The Function. and Explain With Example of Recursion

    Uploaded by

    Dharmendra Gurjar
    The document defines functions and recursion in C. It states that a function is a block of code that performs a specific task, and that all C programs have at least one function, the main() function. Functions are used to divide large programs into modules for easier debugging and maintenance. There are two types of functions: library/predefined functions and user-defined functions. Recursion is when a function calls itself, either directly or indirectly. Recursive functions can be used to solve problems like calculating factorials or generating Fibonacci sequences. Examples are given of recursive functions to find the factorial of a number and of call by value and call by reference.

    Copyright:

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

    Q.13- Define the Function. And explain with example of Recursion.

    Ans - Function in C

    A function is a group of statements that together perform a specific task. Every C


    program has at least one function, which is main().

    Why use function ?

    Function are used for divide a large code into module, due to this we can easily
    debug and maintain the code. For example if we write a calculator programs at that
    time we can write every logic in a separate function (For addition sum(), for
    subtraction sub()). Any function can be called many times.

    Advantage of Function

     Code Re-usability

     Develop an application in module format.

     Easily to debug the program.


     Code optimization: No need to write lot of code.

    Type of Function in C

    There are two type of function in C Language. They are;

     Library function or pre-define function.

     User defined function.

    Recursive Function in C

    When Function is call within same function is called Recursion. The function which
    call same function is called recursive function. In other word when a function call
    itself then that function is called Recursive function.
    Recursive function are very useful to solve many mathematical problems like to
    calculate factorial of a number, generating Fibonacci series, etc.

    Advantage of Recursion

     Function calling related information will be maintained by recursion.

     Stack evaluation will be take place by using recursion.

     In fix prefix, post-fix notation will be evaluated by using recursion.

    Disadvantage of Recursion

     It is a very slow process due to stack overlapping.

     Recursive programs can create stack overflow.

     Recursive functions can create as loops.

    Find the Factorial of any number using recursion


    Example

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

    void main()
    {
    int fact(int);
    int i,f,num;
    clrscr();
    printf("Enter any number: ");
    scanf("%d",&num);
    f=fact(num);
    printf("Factorial: %d",f);
    getch();
    }

    int fact(int n)
    {
    if(a<0)
    return(-1);
    if(a==0)
    return(1);
    else
    {
    return(n*fact(n-1));
    }
    }

    Q.14- Write a program for call by value and call by reference.

    Ans - call by value and call by reference

    Call by value

    In call by value, original value can not be changed or modified. In call by value, when you

    passed value to the function it is locally stored by the function parameter in stack memory

    location. If you change the value of function parameter, it is changed for the current function only

    but it not change the value of variable inside the caller method such as main().
    Call by value

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

    void swap(int a, int b)


    {
    int temp;
    temp=a;
    a=b;
    b=temp;
    }

    void main()
    {
    int a=100, b=200;
    clrscr();
    swap(a, b); // passing value to function
    printf("\nValue of a: %d",a);
    printf("\nValue of b: %d",b);
    getch();
    }

    Call by reference

    In call by reference, original value is changed or modified because we pass reference

    (address). Here, address of the value is passed in the function, so actual and formal arguments

    shares the same address space. Hence, any value changed inside the function, is reflected

    inside as well as outside the function.


    Example Call by reference

    #include<stdio.h>
    #include<conio.h>
    void swap(int *a, int *b)
    {
    int temp;
    temp=*a;
    *a=*b;
    *b=temp;
    }
    void main()
    {
    int a=100, b=200;
    clrscr();
    swap(&a, &b); // passing value to function
    printf("\nValue of a: %d",a);
    printf("\nValue of b: %d",b);
    getch();
    }

    You might also like