Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re: Array Comparison

by thraxil (Prior)
on Dec 22, 2003 at 23:15 UTC ( #316521=note: print w/replies, xml ) Need Help??


in reply to Array Comparison

this is very similar to Ovid's interview question :)

Replies are listed 'Best First'.
Re: Re: Array Comparison
by mcogan1966 (Monk) on Dec 23, 2003 at 20:07 UTC
    Darn right it is. Wow, I had no idea. But now I do know the answer to that question, how and why. So, that's one point for me toward getting that job, whatever it is. Too bad I'm happy where I am right now.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://316521]
help
Chatterbox?
[holli]: *sigh* why has there to be drama in such a thread?
[LanX]: ?
[holli]: Re^2: Let's Make PerlMonks Great Again! -- suggestions and dreams - STFU and write code already (start already)
[LanX]: it was just after Trump-ageddon and the Americans thought I'm ridiculing them ;)

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (9)
As of 2017-11-20 19:45 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:













    Results (292 votes). Check out past polls.

    Notices?