logotransparent.png

Legion of Learners

www.lol-101.com

  • Home

  • Classrooms

  • Courses

  • About Us

    • Executive Team
    • Board Members
  • Resources

  • More

    Use tab to navigate through the menu items.
    To see this working, head to your live site.
    • Categories
    • All Posts
    • My Posts
    Davey Yu
    Jun 09
      ·  Edited: Jun 09

    6/8/22 - Recursive Functions

    in ACSL Contest Prep

    Today, we learned about Recursive Functions, functions that loop repeatedly.


    Hey you, you're finally awake. Comment your answers on this post. If you need any sort of help, I'll answer.



    20192020 IN

    6 comments
    0
    ElijahG
    Jun 09

    3. f(f(f(f(-5)))): Answer: 6 4. Find the smallest value of n such that f(n) > 200 Answer: 6 Note: I don't know if there was a more efficient way to do it, because I did it in O(n) time

    Iris L.
    Jun 09

    3. 4 ? cuz i got f(4) = 4.. :"DD probably wrong

    4. I got 3 -> you don't know the other functions ex f(3) so don't you have to make it f(2) and f(1) ???



    Iris L.
    Jun 10

    oh wait i got 4 wrong it has to be more than 200 mb

    John C.
    Jun 11

    The first one (#3) is 6

    The second one (#4) is 7

    ??? :|??????

    Iris L.
    Jun 12

    idk :/


    Davey Yu
    Jun 15

    Answer Key:



    0
    6 comments

    Questions? Email us at legionoflearners@gmail.com or join our WeChat group!

    • lol-101dotcom

    ©2020 Legion of Learners