++ insightful
Searching CPAN for "Bresenham's line algorithm" returns Algorithm::Line::Bresenham, and an XS version. It looks like it would be feasible to re-purpose the algorithm to split a range a the OP wants.
In reply to Re^2: Split range 0 to M into N non-overlapping (roughly equal) ranges.
by chrestomanci
in thread Split range 0 to M into N non-overlapping (roughly equal) ranges.
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |