Lecture "Algorithms", exercise 3 about 2018-2019 HOT 15 OPEN

I'm not sure about the graphical representation of recursion in the second flowchart!

I think you need to add two ending terminals! Love you anyway. 💃

from 2018-2019.

I'm not sure about the graphical representation of recursion in the second flowchart!

EDIT: added the ending terminals

from 2018-2019.

from 2018-2019.

I try, but I'm not so sure about something.
Ah, above the line there is the first algorith, under the line the second.

P.S. I've forgotten some "no" along the flowchart

from 2018-2019.

I'll come back later to add other solutions that I was thinking of.

from 2018-2019.

from 2018-2019.

from 2018-2019.

from 2018-2019.

Curious to hear what you guys think of this first way, making the algorithm save f(0) and f(1) to later retrieve them:

and then a, b, c way similar to others'

from 2018-2019.

from 2018-2019.

from 2018-2019.

It is necessary to define f before addressing the function. Here: Fib(int n)

Sidenote:
The second paragraph was difficult to understand because it is not clear what "the same function" means.

from 2018-2019.

from 2018-2019.

Applying recursion:

from 2018-2019.

Hi all,

thanks for all the proposed solutions, that look correct to a first sight. Indeed, representing the recursive step with a flowchart could be tricky, but I really liked the simplicity of the approach that have been proposed in your diagrams.

from 2018-2019.