Re^2: Split range 0 to M into N non-overlapping (roughly equal) ranges.

With the addition of a little whitespace and factoring out the step size as that is often required for other parts of the code, that's the one I think:

#! perl -slw
use strict;

our $N //= 2;
our $M //= 1e6;

my $STEP = ( $M + 1 ) / $N;
my @ranges = map [
   int( $_ * $STEP ), int( ( $_+1 ) * $STEP ) -1
], 0 .. $N - 1;

printf "%2d : from %7d to %7d (%7d)\n",
    $_, @{ $ranges[ $_ ] },
    $ranges[ $_ ][ 1 ] - $ranges[ $_ ][ 0 ] + 1
    for 0 .. $#ranges;
[download]

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority".

In the absence of evidence, opinion is indistinguishable from prejudice.

Comment on Re^2: Split range 0 to M into N non-overlapping (roughly equal) ranges. Download Code