Hi, If I use ++ to concatenate two lists, how do I calculate the number of copy operations, i.e. how do I approximate its efficiency compared to adding one element at a time? For example: Does 1:2:3:4:5:6:7:8 execute faster than [1, 2, 3, 4] ++ [5, 6, 7, 8], where the first case is executed recursively in a function? Mike
