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

Re: •SPOILERS Re: (OT) Interview questions -- your response?

by ichimunki (Priest)
on Sep 03, 2002 at 19:16 UTC ( [id://194867]=note: print w/replies, xml ) Need Help??


in reply to •SPOILERS Re: (OT) Interview questions -- your response?
in thread (OT) Interview questions -- your response?

So how about solving the array union question without hashes? I'd sort the arrays and use something like: 
while( @sort_a and @sort_b ){
  if( $sort_a[0] < $sort_b[0]){ shift(@sort_a); }
  elsif( $sort_a[0] > $sort_b[0]{ shift(@sort_b); }
  else{ 
   push @new_array, $sort_a[0];
   shift(@sort_a);
   shift(@sort_b);
  }
}

[download]
This will handle duplicate entries in the arrays differently than the hash solution.

In Section Meditations

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://194867]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others perusing the Monastery: (6)
As of 2024-04-25 10:36 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found