Scribd Logo
Upload

Welcome to Scribd!

  • 4 - Récursivité

    Uploaded by

    Flash
    9 views6 pages
    Recursion is a technique where a function calls itself to break down a complex problem into simpler sub-problems until it reaches a base case. For example, to add a range of numbers recursively, the sum function calls itself, adding the current number to the sum of smaller numbers, eventually reaching a base case of adding 0 which simply returns 0. This allows the complex task of adding multiple numbers to be solved by recursively breaking it down into adding pairs of numbers.

    Original Description:

    Original Title

    4- Récursivité

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    Recursion is a technique where a function calls itself to break down a complex problem into simpler sub-problems until it reaches a base case. For example, to add a range of numbers recursively, the sum function calls itself, adding the current number to the sum of smaller numbers, eventually reaching a base case of adding 0 which simply returns 0. This allows the complex task of adding multiple numbers to be solved by recursively breaking it down into adding pairs of numbers.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    9 views6 pages

    4 - Récursivité

    Uploaded by

    Flash
    Recursion is a technique where a function calls itself to break down a complex problem into simpler sub-problems until it reaches a base case. For example, to add a range of numbers recursively, the sum function calls itself, adding the current number to the sum of smaller numbers, eventually reaching a base case of adding 0 which simply returns 0. This allows the complex task of adding multiple numbers to be solved by recursively breaking it down into adding pairs of numbers.

    Copyright:

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

    Recursion

    Mr Benabderrezak
    Introduction

    • Recursion is the technique of making a function call itself.


    Example

    • Adding two numbers together is easy to do, but adding a


    range of numbers is more complicated.

    • In the following example, recursion is used to add a range of


    numbers together by breaking it down into the simple task of
    adding two numbers
    Example
    Example
    • When the sum() function is called, it adds parameter k to the sum of all numbers
    smaller than k and returns the result. When k becomes 0, the function just returns 0.
    • When running, the program follows these steps:
    1. 10 + sum(9)
    2. 10 + ( 9 + sum(8) )
    3. 10 + ( 9 + ( 8 + sum(7) ) )
    4. ...
    5. 10 + 9 + 8 + 7 + 6 + 5 + 4 + 3 + 2 + 1 + sum(0)
    6. 10 + 9 + 8 + 7 + 6 + 5 + 4 + 3 + 2 + 1 + 0

    You might also like