scala ranges versus lists performance on large collections

Question

I ran a set of performance benchmarks for 10,000,000 elements, and I\'ve discovered that the results vary greatly with each implementation.

Can anybody explain why c

Answer 1

In the first example you create a linked list with 10 elements by computing the steps of the range.

In the second example you create a linked list with 10 millions of elements and filter it down to a new linked list with 10 elements.

In the third example you create an array-backed buffer with 10 millions of elements which you traverse and print, no new array-backed buffer is created.

Conclusion:

Every piece of code does something different, that's why the performance varies greatly.