Lecture "Algorithms", exercise 3
essepuntato opened this issue · 26 comments
The previous lecture notes, entitled “Introduction to Computational Thinking”, illustrate two different algorithms, expressed in natural language, for implementing the Fibonacci function. Create two distinct flowcharts to implement both of them.
Referring to the first algorithm (sorry for my handwriting)
I think this is the first algorithm
And I think this is the second but tbh my head hurts
I forgot to specify the value in the third return value box, should be return value "sum" or something like that...
I don't know if this was what I was supposed to come up with, but I tried to make something similar to a "do loop" with a check variable, in order to generalie the function.
Fibonacci without recursion
Fibonacci with recursion
This is the first algorithm
Flowchart for the first algorithm
Flowchart for the second algorithm
Second (recursive) algorithm:
First algorithm
Second algorithm
Fibonacci ex. 1
Fibonacci 2
The second flowchart
Fibonacci 1
Fibonacci 1
Fibonacci 2
