Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine

Re^2: Finding longest palindrome from a string

by ccn (Vicar)
on Aug 14, 2004 at 08:44 UTC ( #382923=note: print w/replies, xml ) Need Help??

in reply to Re: Finding longest palindrome from a string
in thread Finding longest palindrome from a string

fizbin's solution seems to be faster than your one.

  • Comment on Re^2: Finding longest palindrome from a string

Replies are listed 'Best First'.
Re^3: Finding longest palindrome from a string (optimizing Perl)
by Aristotle (Chancellor) on Aug 14, 2004 at 08:59 UTC

    Oops, thank you. I missed that one because I downloaded the solutions by crawling the displaycode links on the thread page and he didn't put his entry in CODE tags.

    It works correctly and therefor qualifies, but I only get about 340 iterations/s for it. That puts it next to Limbic~Region's entry in my chart. I'm not surprised, as his code is quite complex and involves a true for(;;) loop (relatively slow in Perl). Fast code in Perl means as few opcodes as possible and letting builtins do work implicitly as much as possible. (See GRT, f.ex.)

    That is how I arrived at my second version. I copied the first version, ripped everything except the XOR out of the loop, and started benchmarking them against each other as I tried to accelerate extraction of null runs from the bitmask and rotation of the reverse string. Every single operation I added to the (non-functional, skeletal) second version had a dramatic impact on speed. Whatever I did, I found nothing with which to improve upon while( /\0{3,}/g ) { } and substr+chop. I only managed to get a speedup when I constrained the match further so that the regex engine isn't exited to drop into the loop body for null runs that are too short to be candidates. Apparently, avoiding that penalty by skipping matches implicitly more than makes up for the additional cost of having to compile the regex multiple times, which skipping them explicitly didn't require.

    The version and compile-time flags of the Perl in use probably matter to some degree, as well.

    Makeshifts last the longest.

      Your benchmarking is not fair. The place is hihgly dependend on input data. E.g. if you use only     'abcdedcbabcdefgfedcbabcdefghijklmnonmlkjihgfedcbabcdefghijklkjihgfedcbabcdefghijklmnoponmlkjihgfedcba' you get other results.

      I can't imagine a fair benchmark because it must go through all possible permutations for short and very very long strings. Or it must use random input data and calculate the statistics.

        Go ahead, the code is there. :-) I simply took cLive ;-)'s code as a starting point myself.

        Makeshifts last the longest.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://382923]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (3)
As of 2017-06-25 10:47 GMT
Find Nodes?
    Voting Booth?
    How many monitors do you use while coding?

    Results (567 votes). Check out past polls.