Scribd Logo
Upload

Welcome to Scribd!

  • Head

    Uploaded by

    Lester
    2 views1 page
    The document describes a recursive function called fun that takes an integer parameter n. It recursively calls itself with n-1 until n is no longer greater than 0, at which point it prints out the values of n from the recursive calls in descending order. For an input of 3, it recursively calls fun(2) and fun(1) before the base case of fun(0), and then prints 123 when returning from the recursive calls.

    Original Description:

    Head Recursion in Functional Programming

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a recursive function called fun that takes an integer parameter n. It recursively calls itself with n-1 until n is no longer greater than 0, at which point it prints out the values of n from the recursive calls in descending order. For an input of 3, it recursively calls fun(2) and fun(1) before the base case of fun(0), and then prints 123 when returning from the recursive calls.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2 views1 page

    Head

    Uploaded by

    Lester
    The document describes a recursive function called fun that takes an integer parameter n. It recursively calls itself with n-1 until n is no longer greater than 0, at which point it prints out the values of n from the recursive calls in descending order. For an input of 3, it recursively calls fun(2) and fun(1) before the base case of fun(0), and then prints 123 when returning from the recursive calls.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    HEAD RECURSION

    For instance,

    def fun(n):

    if(n > 0):

    fun(n – 1)

    print(n, end=””)

    print(fun(3)

    Output: 123

    Explanation:

    In this case, the function is called with the argument of 3, which is greater than 0. The
    function then calls itself again with the argument of 2, followed by 1, and then 0. Each time the
    function is called, the value of n is printed. When the condition of n > 0 is no longer met (n = 0), the
    function stops calling itself and the statement print(fun(3)) is executed, which prints out the values
    of n from 3 to 1 in descending order, resulting in 1 2 3.

    You might also like