Re^2: An efficient way to gather a common portion of several strings' beginnings

Speaking of algorithmic efficiency. Consider the case where $string[17] eq "x" and preceding values all span kilobytes. Clearly, there's some room for improvement.

Comment on Re^2: An efficient way to gather a common portion of several strings' beginnings Download Code

Replies are listed 'Best First'.
Re^3: An efficient way to gather a common portion of several strings' beginnings by BrowserUk (Patriarch) on Nov 15, 2015 at 19:03 UTC
Speaking of algorithmic efficiency. Consider the case where $string17 eq "x" and preceding values all span kilobytes. Clearly, there's some room for improvement. Hm. You could sort the strings, but sorting is O(n log n) instead of O(n). Still think so? With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday' Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error. "Science is about questioning the status quo. Questioning authority". I knew I was on the right track :) In the absence of evidence, opinion is indistinguishable from prejudice.	[reply]

Replies are listed 'Best First'.

Re^3: An efficient way to gather a common portion of several strings' beginnings
by BrowserUk (Patriarch) on Nov 15, 2015 at 19:03 UTC

Speaking of algorithmic efficiency. Consider the case where $string17 eq "x" and preceding values all span kilobytes. Clearly, there's some room for improvement.

Hm. You could sort the strings, but sorting is O(n log n) instead of O(n).

Still think so?

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority". I knew I was on the right track :)

In the absence of evidence, opinion is indistinguishable from prejudice.

[reply]