On 22/11/2009, at 5:02 , Jon Harrop wrote:

By the above reasoning, if I were to run any program
using arrays on a system with a two space garbage collector (which copies
all live objects during each GC) I could say the worst case algorithmic
complexity was O(n). That doesn't sound right.

Can you write a program that demonstrates this effect as I did?

I believe your numbers, but I don't have a F# install to test against ATM.


Suffice to say, Haskell is nowhere near being in the ballpark of C++'s 
performance for basic functionality like dictionaries and sorting.

Sorry, I wasn't trying to start a pissing match. I just wanted to know what the issue was so I could avoid it in my own programs.

Thanks!

Ben.