Advertisement
Guest User

Untitled

a guest
Apr 10th, 2019
119
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
OCaml 0.34 KB | None | 0 0
  1. (* sum all integers from 1...n *)
  2. let sum_from_one n =
  3.    let rec aux n sum =
  4.       if n > 0
  5.       then aux (n - 1) (sum + n)
  6.       else sum
  7.    in aux n 0
  8.  
  9. (* int list of fibonacci numbers of length n *)
  10. let fibs_list n =
  11.    let rec aux a b l =
  12.     if List.length l = n then l
  13.     else aux b (a+b) (b::l)
  14.    in List.rev (aux 0 1 []);;
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement