Re: [FWP] A heftier challenge for y'all

[John Porter <jdporter@min.net>]

Bernie Cosell wrote:

> On 20 Jul 99, at 10:01, John Porter wrote:
> 
> > You've probably seen the word puzzles that involve transforming one
> >...
> > the pair of words with the *longest* such "shortest path".
> 
> Well, this proved to be a fairly hard problem!!

I guess so, since it has taken this long for anyone to even say
they attempted it!


> A followup to this [forget who it was from] said that they had a solution 
> that is O(n^2). I wonder how they managed that...  

Actually I haven't tested it, but I believe my solution is O(n^2).
I suppose I ought to do a rigorous analysis...

John Porter


==== Want to unsubscribe from Fun With Perl?  Well, if you insist...
==== Send email to <fwp-request@technofile.org> with message _body_
====   unsubscribe