Because an array is ordered, it's very easy to print out entire array of arrays in *some* kind of order (assuming that you've been keeping it in some kind of order).

Take, for example, the following array of arrays.

my @level1 = (
   [1, 2, 3, 4, 5],
   [6, 7, 8, 9, 10]
);
[download]

To print the entire array, you need to do the following:

for (my $i = 0; $i < @level1; $i++) {
     for (my $j = 0; $j < @{$level1[$i]}; $j++) {
          print STDOUT "\$i: " . $i . " \$j: " . $j . " value: " . $le
+vel1[$i][$j] . "\n";
     }
}
[download]

There are several ways of making this code faster, but only at the cost of readability.

Of course, life gets more difficult if you don't know in advance what kind of array-of-array (or List of Lists: LOL) you're dealing with.

That's where the ref function comes in handy.

my @level1 = (
    [ 1, 2, 3, [4, 5] ],
    6,
    7,
    [ 8, [9, [10] ] ],
);

&read_array(\@level1);

exit 0;

sub read_array {
    my $array_reference = shift;

    foreach (@$array_reference) {
        if (ref($_) eq 'ARRAY') {
            &read_array($_);
        } else {
            print $_ . "\n";
        }
    }
}
[download]

Here we shifted to basic recursion -- something that calls itself -- to handle the fact that we don't know how deep the LOL runs nor how many elements any given list will contain.

Using subroutines to print an LOL is slightly slower (there's overhead for subroutine calls), but in this case the flexibility gain makes it worthwhile.

As for printing a section of an LOL, you'll have to define the problem a little more because there's any number of ways of tackling it.