Re^2: Five Ways to Reverse a String of Words (C#, Perl 5, Perl6, Ruby, Haskell)

One may do this with a logarithmic number of concatenations, though (instead of linear). I don't see a feasible way to do such a thing with StringBuilder,

That may make concatenation faster than StringBuilder even in the case of a large number of strings.

I wonder how Perl's join actually works.

Comment on Re^2: Five Ways to Reverse a String of Words (C#, Perl 5, Perl6, Ruby, Haskell) Select or Download Code

Replies are listed 'Best First'.
Re^3: Five Ways to Reverse a String of Words (C#, Perl 5, Perl6, Ruby, Haskell) by fergal (Chaplain) on Aug 13, 2007 at 12:22 UTC
How do you concatenate n strings in O(log n)? Every string will have to be concatenated to something least once, so it's not obvious to me how it could ever be less than O(n). Concatenating in pairs and then concatenating the results etc adds up to O(n).	[reply]
Re^4: Five Ways to Reverse a String of Words (C#, Perl 5, Perl6, Ruby, Haskell) by akho (Hermit) on Aug 13, 2007 at 19:30 UTC
Oh. Now I'm ashamed of myself.	[reply]
Re^5: Five Ways to Reverse a String of Words (C#, Perl 5, Perl6, Ruby, Haskell) by Anonymous Monk on Feb 22, 2008 at 09:08 UTC
Isn't that O(h)?	[reply]