That comment points out a version of the code which instead of using the same array to hold all the elements which we're currently 'on', creates a separate array each time. To use it change the body of the for loop from:

push @$list, $$items[$i];
comb_integral($items, $group - 1, $list, $i + 1);
pop @$list;
[download]

to the single line:

comb_integral($items, $group - 1, [@$list, $$items[$i]], $i + 1);
[download]

And here's the new-improved version which returns the combinations instead of printing them, although it does create and destroy a few anonymous arrays in the process:

#!/usr/bin/perl
use strict;
use warnings;

use Data::Dumper;

my @list = (1 .. 5);
my $take = 2;

my @combs = comb_integral(\@list, $take);
for my $comb (@combs) {
  print "@$comb\n";
}

sub comb_integral {
  my ($items, $group, $next) = @_;
  $next ||= 0;

  if ($group == 1) {
    return map [$_], @$items[$next..$#$items];
  } else {
    my @returns;
    for my $i ($next..$#$items) {
      push @returns, map [$$items[$i], @$_], comb_integral($items, $gr
+oup - 1, $i + 1);
    }
    return @returns;
  }
}
[download]

In fact I've just thought of another variant of that, replace the push line in the for loop with:

push @returns, my @combs = comb_integral($items, $group - 1, $i + 1);
unshift @$_, $$items[$i] for @combs;
[download]

Although some might prefer not to code quite so tersely ;-).

--
integral, resident of freenode's #perl

Update: I've just benchmarked this (as integral2) and don't bother with the variant suggested at the end as it's the slowest of my four versions. This does beat by two earlier ones however. Here's my benchmark results: