New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

fibonacci #2

Open

DylanLej opened this issue Feb 15, 2018 · 1 comment

DylanLej commented Feb 15, 2018

let rec fib n = if n<2 then n else fib(n-1) + fib(n-2);;

fghsgh commented Feb 15, 2018

ackermann: let rec ack m n = match [m;n] with [0;_] -> n+1 | [_;0] -> ack (m-1) 1 | [_;_] -> ack (m-1) (ack m (n-1))

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment