Re^4: Finding longest palindrome from a string

in reply to Re^3: Finding longest palindrome from a string (optimizing Perl)
in thread Finding longest palindrome from a string

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.

Comment on Re^4: Finding longest palindrome from a string Download Code

Replies are listed 'Best First'.
Re^5: Finding longest palindrome from a string by Aristotle (Chancellor) on Aug 14, 2004 at 09:48 UTC
Go ahead, the code is there. `:-)` I simply took cLive ;-)'s code as a starting point myself. Makeshifts last the longest.	[reply]

In Section Seekers of Perl Wisdom