Scribd Logo
Upload

Welcome to Scribd!

  • Functii Recursive

    Uploaded by

    Cristina Bolea
    1 views1 page
    The document defines a recursive function f that takes integers as input and performs different operations on those integers to return an output. It provides examples of applying the function f to various integer inputs and calculating the outputs through the recursive steps. It also defines another function f that takes two integers as input and performs operations related to summing digits and removing occurrences of a digit to return an output.

    Original Description:

    Original Title

    functii recursive

    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 defines a recursive function f that takes integers as input and performs different operations on those integers to return an output. It provides examples of applying the function f to various integer inputs and calculating the outputs through the recursive steps. It also defines another function f that takes two integers as input and performs operations related to summing digits and removing occurrences of a digit to return an output.

    Copyright:

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

    Functii Recursive

    Uploaded by

    Cristina Bolea
    The document defines a recursive function f that takes integers as input and performs different operations on those integers to return an output. It provides examples of applying the function f to various integer inputs and calculating the outputs through the recursive steps. It also defines another function f that takes two integers as input and performs operations related to summing digits and removing occurrences of a digit to return an output.

    Copyright:

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

    f(1234)=f(123)=4

    f(123)=3+f(12)=4
    f(12)=f(1)=1
    f(1)=1+f(0)=1
    suma cifrelor impare f(0)=0
    f(720721, 7)=1+10*f(72072, 7)=2021
    f(72072, 7)=2+10*f(7207, 7)=202
    f(7207, 7)= f(720, 7)=20
    f(720, 7)=0+10* f(72, 7)=20
    f(72, 7)=2+10* f(7, 7)=2
    f(7,7)=f(0,7)=0
    Elimina toate aparitiile cifrei c f(0,7)=0
    f(2)=2
    f(21)=21-f(19)=10
    f(19)=19-f(17)=11
    f(17)=8
    f(15)=9
    f(13)=6
    f(11)=7=11-9+7-5+3
    F(9)=4=9-7+5-3
    F(7)=7-f(5)=7-5+3
    f(5)=5-f(3)=5-3=2
    f(3)=3

    f(21)=21-19+17-15+13-11+9-7+5-3=10
    f(23)=23-f(21)=13
    f(100)

    You might also like