[erlang-questions] Efficiency of a list construction

Ulf Wiger <>
Fri May 20 13:11:58 CEST 2011


On 20 May 2011, at 13:08, Paul Barry wrote:

> Both books talk about the efficiency of tail recursion over direct
> recursion with a bit of talk about how the run-time may optimize for
> code that isn't tail recursive to improve its performance.  The
> suggestion seems to be that in older versions of the run-time, tail
> recursion won hands down, but that nowadays this may not always be the
> case.  Is there an update on this?

The Erlang/OTP Efficiency Guide is the most up-to-date document on the matter.

E.g. Chapter 5.4  - Why you should not worry about recursive lists functions

http://www.erlang.org/doc/efficiency_guide/listHandling.html#id64754

BR,
Ulf W

Ulf Wiger, CTO, Erlang Solutions, Ltd.
http://erlang-solutions.com



-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://erlang.org/pipermail/erlang-questions/attachments/20110520/f58bde2e/attachment.html>


More information about the erlang-questions mailing list