Now, F#

OK, let's look at Fibonacci in F#:

	let rec fib n =
	match n with
	|0|1 -> n
	|x when x > 0 -> fib(x - 1) + fib(x - 2)
	for x in 0..39 do
	printfn "fib(%d) = %d" x (fib x)

view raw gistfile1.fs hosted with ❤ by GitHub

It took 4 seconds compiled as debug (and 3 seconds compiled as release). Very, very impressive, I must say. The code looks as clean as Erlang equivalent, however pattern matching in Erlang is obviously more power - it supports matching function arguments and binding variables right in the patterns. However, this is the very first day I learn F#, so I may be mistaken about its pattern matching features. If this is the case, I'll sure update this post later.

Update 21.06.15

	let main _ =
	let rec fib n = if n < 2 then n else fib(n - 1) + fib(n - 2)
	let w = Stopwatch.StartNew()
	for n in 0..39 do printfn "fib(%d) = %d" n (fib n)
	printfn "%O elapsed." w.Elapsed
	Console.ReadKey() |> ignore
	0

view raw fib.fs hosted with ❤ by GitHub

Result: 1.38 seconds in Release configuration.