Writing Fibonacci in MIPS (caller saved)

MIPS code writing example of a recursive function (with 2 recursive calls), using caller-saved registers

[Rmontgomery]

Any idea why I might be getting "Runtime exception at 0x00400060: address out of range 0x7fbffffc" at the line sw $v0, 8($sp)?

[TheBumi]

great tutorial, but your add should be an addi, cheers :)

[daadii]

it's bge instead of bgt, otherwise it would not calculate the correct sequence

[lefterismagkoutas]

is it possible to not use registers and to make it only with stack pointer?

[ScoopsPlz]

You... don't ever run it? M8, I'm garbage at this stuff and even I can pick out issues with with this, ones you would likely be aware of if you bothered trying to run it.

[sukritkapil]

Thanks for this video. It is really helpful!

[rickk]

Why do you save v0 on the stack you could aswell use a temporary register. Still dont figured out 100% why we use this stack thing so often.

[EsmirAlvarez]

Thank you very much, greatly appreciate it. =)

[SrajanBhatnagar]

Why do we do the 'jr $ra' ? kindly explain ?

[Muhsin]

at 2:17 you just store $a0 in your stack. Actually, in MIPS reference call you first gotta move $a0 to $s0(for example), since we just use the $a registers for arguments and $s registers to save numbers or variables for example for recursive functions. But this should work, tho....

[張大刀-gy]

wft are you talking? add xx xx imm isn't exist dude