Today, we learned about Recursive Functions and how to solve them. 1.

From Question 2 Junior Contest 1 of 2017-2018

2. Select the correct answer

This is kinda hard so I understand if you get this wrong

Junior All Star Short Question 3 of 2016-2017
3.

Senior Question 2 Contest 1 of 2019-2020

4.

Junior All-Star Question 2 of 2017-2018

5. Define a recursive function in your own words

11

C(11)

-11

C(9)

A recursive function is a function that defines it directly or indirectly until it reaches a base case.

11

11 (C)

-11

9 (C)

A recursive function is a function that repeats itself until it reaches a base case. Then it works all the way back to the top using the base case.

11

C

-11

B

A recursive function is a repeating function that has an eventually termination point, specified in the function. One example of a recursive function is the Fibonacci Sequence.

Forgot to mention, please join the LoL Discord Server for pings about when to join, homework help, and other!

https://discord.gg/DZkqSmUq11 , goes 9->13->17->14->11

C(11) goes 11->10->9->10->11(i think)

-11, goes 2->-14->-18->-19->-15->-11

C(9) goes 4->7->10->9->8->7->10->9

A recursive function is like an if and elif function in Python.

11

C (11)

-11

C (9)

A recursive function is a process that repeats itself.

11

C

-11 (Originally thought some of the minuses were multiplications)

C

A recursive function is a function that can solve itself by first going forward, then backward.

Note: In this case, question 5 basically means "What is a recursive function?"