examples/fib.sil


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

/**
 * The Fibonacci function
 */
Int fib(Int n) {
	// Base cases
	if (n == 1 || n == 2) {
		return 1;
	// Recursive case
	} else {
		return fib(n - 1) + fib(n - 2);
	}
}

Int main() {
	return fib(10);
}