[erlang-questions] Performance of the append/reverse idiom
Mon Jul 16 08:32:24 CEST 2007
I'm still going through Joe's book, but as a C/C++ hack, I can't help
but have some reservations about performance. One common idiom is to
append to the front of a list and then reverse the list when the append
is complete. I assume this a O(n) operation. Is it common for reverse
to be a bottleneck in many applications?
More information about the erlang-questions