Beefy Boxes and Bandwidth Generously Provided by pair Networks RobOMonk
XP is just a number
 
PerlMonks  

Re: Re: Re: TIMTOWTDI and other languages

by mdillon (Priest)
on Apr 28, 2002 at 23:22 UTC ( #162728=note: print w/ replies, xml ) Need Help??


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

It is a double loop; what's your point? This isn't "come up with the most efficient way to do X", or "do X without using a nested loop", it is (at least so far as I am interested) "show me idiomatic ways to do X". To quote Ovid, "I am wondering how different types of languages would solve the problem of identifying elements in one array that exist in another". I suppose Perl 6 isn't a different type of language than (recent) previous versions of Perl, but I thought the DWIM aspect of the Perl 6 code made the example worth posting.


Comment on Re: Re: Re: TIMTOWTDI and other languages
Re: Re: Re: Re: TIMTOWTDI and other languages
by abstracts (Hermit) on Apr 28, 2002 at 23:31 UTC
    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.

      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?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://162728]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (5)
As of 2014-04-19 20:22 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    April first is:







    Results (483 votes), past polls