Question

Discrete Mathematics question inside

Answer 1

suppose the code was this
```
main()
{
int n, i, a, b, c;
printf("How many numbers in the series? ");
scanf("%d", &n);
a = 0;
b = 1;
for (i = 0; i < n; i++)
{
a = b;
b = c;
c = b + a;
printf("%d ",c );
}
}

Answer 2

then the pseudocode will be
```
procedure fib(n : integer)
```

<Y/N>

Answer 3

need some help here... @hartnn

Answer 4

yes, there will be one input.

Answer 5

then i suppose it continues

```
procedure fib (n : integer)

for i = 2 to n
a = b
b = a
c = b + a

{c is the sum of the two previous terms}
```
is there something missing?

Answer 6

ahh yes

```
procedure fib (n : integer)

a = 0
b = 1

for i = 2 to n
a = b
b = a
c = b + a

{c is the sum of the two previous terms}
```

Answer 7

yes.
what are u trying to do with that procedure ?

Answer 8

no idea

Answer 9

```
procedure fib (n : integer)

a = 0 {a is the first number of the series}
b = 1 {b is the second number of the series}

for i = 2 to n
a = b
b = a
c = b + a

{c is the sum of the two previous terms}
```

Answer 10

are u only returning next fib number ? (then its incorrect)
u realize that here u have to call the fib function again in for loop. like make it recursive ...

Answer 11

what do you mean call again

Answer 12

u wanna display only last fib number? then that procedure is correct!
if want to display all fib numbers then u have to recursive call fib inside for loop

Answer 13

recursive call?

Answer 14

the code u wrote displays all

Answer 15

are we talking about my code? or my pseudocode?

Answer 16

code in 1st comment displays all fib numbers
your pseudocode displays(or i should say returns) last fib number

Answer 17

then how should i write it so that it displays all?

Answer 18

see whether this makes sense

procedure fib (n : integer)

a = 0
b = 1

a = b
b = a
c = b + a
display c
a=b
b=c
procedure fib(n-1:integer)

{c is the sum of the two previous terms}

Answer 19

no it won't work.

Answer 20

?

Answer 21

because everytime , u will initialize a=0,b=1...that should not be done

Answer 22

this is how a bubblesort algorithm looks like

Answer 23

so i think what i did is fine without this "recursion"