There's allot of posts going out on assignment 2, and here's mine...

Can't help thinking there is something amiss with Q3, the recursive function does seem to achieve anything.

running funcRec(5,'A'

simply prints B - I get it, it converts (casts) the char v into a int, add 1 and cast this into a char before displaying it.

the recursive call manages to decrement u each round. Anyway, lemme know if there supposed to be more...

In terms of Question 5, optimise fibonacci recursive by taking the thinking behind the itterative approach. The problem here is that fibonacci requires tracking to two values. 0 1 1 2 3 5 8 13 21 ... you need to have 0+1 = 1, and 1+1=2, we all know the sequence. But to keep track of two variables when only 1 is returned by a function is a little tricky? hence the original recursive calculates previous and the one before the previous.

I've tried a few approaches and have not solved this one yet, maybe this is something stupid like

int fibonacci( int, int * )

and the function can now "return" two variables... will see what I can come up with - not looking to be spoonfed the answer, just looking for a hint...