untitled.c

byte * fib(byte *prev, byte *curr, int n)
{
	byte *next;
	// Fib(0) = 0
	if (n == 0) { return prev; }
	next = sum(prev, curr);
	if (n > 2) {
		return fib(curr, next, n - 1);
	} else {
		return next;
	}
}