Pathologically Eclectic Rubbish Lister | |
PerlMonks |
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 ( [id://632192]=note: print w/replies, xml ) | Need Help?? |
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).
In Section
Meditations
|
|