note
blokhead
You can always save space by never storing anything -- just recompute a sum every time you need it.. Here's a solution that uses constant space:
<c>
sub print_sums {
my ($listA, $listB) = @_;
my $min = $listA->[0] + $listB->[0] - 1;
while ($min < $listA->[-1] + $listB->[-1]) {
my $nextmin = undef;
my $multiplicity = 0;
for my $i (0 .. $#$listA) {
for my $j (0 .. $#$listB) {
my $sum = $listA->[$i] + $listB->[$j];
if ($sum > $min and ($sum < $nextmin or not defined $nextmin)) {
($nextmin, $multiplicity) = ($sum, 1);
} elsif ($sum == $nextmin) {
$multiplicity++;
}
}
}
print( ($nextmin) x $multiplicity);
$min = $nextmin;
}
}
</c>
At each iteration, it traverses both lists to find the next smallest possible sum, and how many times it occurs. It only needs to keep track of $min, $nextmin, $multiplicity, $i, $j.
<p>
Of course the tradeoff is the running time, which is O((NM)<sup>2</sup>).
<p>
Perhaps the metric should be to minimize the product of time space complexities? For comparison, naively computing all sums and sorting uses NM space and NM log(NM) time, so it's slightly worse than mine under the combined metric.
<p>
<b>Update:</b> extra parens around print statement..
<!-- Node text goes above. Div tags should contain sig only -->
<div class="pmsig"><div class="pmsig-137386">
<p>
blokhead
</div></div>
820975
820975