Rust Fibonacci

main.rs

fn main() {
    test_fibonacci(10);
}

fn test_fibonacci(n: u32) {
    println!("fibonacci({}) -> {}", n, fibonacci(n));
}

fn fibonacci(n: u32) -> u32 {
    // Whenever I use recursion, I think of it in terms of what are the
    // possible outcomes of each level of recursion. Having a top level
    // match statement makes this recursive function for me very easy
    // to read.
    match n {
        0 => return 0,
        1 => return 1,
        _ => fibonacci(n - 1) + fibonacci(n - 2),
    }
}