Lecture "Algorithms", exercise 3

[essepuntato]

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.

[IlaRoss]

Referring to the first algorithm (sorry for my handwriting)

[laurentfintoni]

I think this is the first algorithm

[laurentfintoni]

And I think this is the second but tbh my head hurts

[laurentfintoni]

I forgot to specify the value in the third return value box, should be return value "sum" or something like that...

[giorgiasampo]

[SarahTew]

[gabrielefiorenza]

[giorgiasampo]

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.

[dbrembilla]

Fibonacci without recursion

Fibonacci with recursion

[edoardodalborgo]

This is the first algorithm

[ChiaraCati]

[ChiaraCati]

[SusannaPinotti]

Flowchart for the first algorithm

[SusannaPinotti]

Flowchart for the second algorithm

[diegochillo]

Second (recursive) algorithm:

[ConstiDami]

First algorithm

Second algorithm

[penelopelask]

[yunglong28]

Fibonacci ex. 1

[yunglong28]

Fibonacci 2

[Fran-cesca]

[GiuliaMenna]

[AlessandraFa]

[DeniseBas]

[LuisAmmi]

The second flowchart

[AlessandroBertozzi]

Fibonacci 1

[enri-ca]

Fibonacci 1

Fibonacci 2