Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re: Re: Re: Re: TIMTOWTDI and other languages

by abstracts (Hermit)
on Apr 28, 2002 at 23:31 UTC ( #162729=note: print w/replies, xml ) Need Help??

in reply to Re: Re: Re: TIMTOWTDI and other languages
in thread TIMTOWTDI and other languages

Sorry if I offended you, but I was under the impression that Ovid wanted to see efficient solutions when he said: Two 100 element arrays leads to 10,000 iterations. So, how do you solve the scalability issue?

I could very well be wrong.

  • Comment on Re: Re: Re: Re: TIMTOWTDI and other languages

Replies are listed 'Best First'.
Re: Re: Re: Re: Re: TIMTOWTDI and other languages
by TheDamian (Priest) on Apr 30, 2002 at 04:08 UTC
    The example would work in Perl 6.

    It would also scale a little better than nested loops since =~ on an array will short-circuit on finding any match in the array.

    Of course, Perl 6 may also have superpositions natively, in which case the problem might be solvable in constant time (on the right hardware ;-)

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (10)
As of 2018-02-22 14:32 GMT
Find Nodes?
    Voting Booth?
    When it is dark outside I am happiest to see ...

    Results (294 votes). Check out past polls.