process

Concurrent Programming II.

1.Concurrency is easy…?

( http://armstrongonsoftware.blogspot.com/2006/08/concurrency-is-easy.html )

2.Sequential Programming

-module(factorial).
-export([factoriala/1, factorialb/1, factorialc/1, factoriald/1]).

%Simplest:
factoriala(0) -> 1;
factoriala(N) -> N * factoriala(N - 1).

%Using function guards:
factorialb(0) -> 1;
factorialb(N) when N > 0 -> N * factorialb(N - 1).

%Using if:
factorialc(N) ->
           if
           N == 0 -> 1;
           N > 0 -> N * factorialc(N - 1)
end.