Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine

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

by Abigail-II (Bishop)
on Sep 04, 2002 at 12:21 UTC ( #195051=note: print w/replies, xml ) Need Help??

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

The runtime scales with the product of the sizes of the two arrays.
So? ;-) No matter what method you choose, worst case, the runtime will be at least proportional to the product of the sizes of the two array, if only because that can be the output size. See below.
my %b_hash = map { $_ => 1 } @b_array; my @new_array = grep $b_hash{$_}, @a_array;
You (and I think all of the others who answered this question) just failed question 1b. This will only work if the elements of @b_array are unique - but that's not given, and you shouldn't make that assumption; at least not without mentioning it.

I'd do something like:

my %b_hash; $b_hash {$_} ++ for @b_array; my @c_array = map {($_) x ($b_hash {$_} || 0)} @a_array;
which has a running time of O (sizeof (input) + sizeof (output)), which is asymptotical optimal.


Log In?

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

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (4)
As of 2020-02-17 19:55 GMT
Find Nodes?
    Voting Booth?
    What numbers are you going to focus on primarily in 2020?

    Results (72 votes). Check out past polls.