fn fib(n: usize) -> usize {
    if n == 0 || n == 1 {
        n
    } else {
        fib(n - 1) + fib(n - 2)
    }
}
// This terribly slow implementation
// will allow us to be rough on the cpu
This terribly slow implementation
will allow us to be rough on the cpu
This terribly slow implementation will allow us to be rough on the cpu
fn fib(n: usize) -> usize {
    if n == 0 || n == 1 {
        n
    } else {
        fib(n - 1) + fib(n - 2)
    }
}
fn fib ( n : usize ) -> usize { if n == 0 || n == 1 { n } else { fib ( n - 1 ) + fib ( n - 2 ) } }
This terribly slow implementation
will allow us to be rough on the cpu
This terribly slow implementation will allow us to be rough on the cpu
n
usize
n
usize