Tail/Non tail recursion
Thu Aug 28 14:45:28 CEST 2003
square([H|T]) -> [H*H|square(T)];
square() -> .
Since the one you wrote will not compile. :)
No, I think this is one of the most efficient ways to do it and it is
An alternative would be:
lists:map(fun(X) -> X*X end,
> Hi All,
> Is there a better way to write this code when there is a lot of
> elements in the list?
> square([H|T]) -> [(H*H|square(T)];
> square() -> .
More information about the erlang-questions