Array::Tour is a base class for iterators that traverse the cells of an array. This class should provide most of the methods needed for any type of tour, whether it needs to visit each cell or not, and whether the tour needs to be a continuous path o...

• Array::Tour::Spiral - Return coordinates to take a spiral path.
• Array::Tour::RandomWalk - Return coordinates to take a random path.
• Array::Tour::Serpentine - Return coordinates to take a serpentine path.

Simply put, this package create mazes. You may use the Games::Maze package to create 3-dimensional rectangular or hexagonal mazes. Mazes are objects that you can manipulate using the available methods. Maze Object Methods new([<attribute> => value, ....

This module will create sorting networks, a sequence of comparisons that do not depend upon the results of prior comparisons. Since the sequences and their order never change, they can be very useful if deployed in hardware, or if used in software wi...

• Algorithm::Networksort::Best - Optimized Sorting Networks.

This package supplies a set of functions that find the roots of polynomials, along with some utility functions. Roots will be either real or of type Math::Complex. Functions making use of the Sturm sequence are also available, letting you find the nu...

This module minimizes tables of Boolean expressions <https://en.wikipedia.org/wiki/Boolean_algebra> using the algorithms available on CPAN. It lets you contain related sets of problems (represented by their columns) in a single object, along with the...

• Logic::TruthTable::Util - provide utility functions to Logic::TruthTable
• Logic::TruthTable::Convert81 - provide Base81 encoding to Logic::TruthTable

This module implements a *Base81* conversion for encoding binary data as text. This is done by interpreting each group of fifteen bytes as a 120-bit integer, which is then converted to a seventeen-digit base 81 representation using the alphanumeric c...

This module uses Algorithm::Networksort to experiment with sorting networks. Introduction To Sorting Networks <http://hoytech.github.io/sorting-networks/> By default this script examines the output of all implemented algorithms and the currently best...

This module implements a *Base85* conversion for encoding binary data as text. This is done by interpreting each group of sixteen bytes as a 128-bit integer, which is then converted to a twenty-digit base 85 representation using the alphanumeric char...

This module minimizes Boolean expressions <https://en.wikipedia.org/wiki/Boolean_algebra> using the Quine-McCluskey algorithm <https://en.wikipedia.org/wiki/Quine%E2%80%93McCluskey_algorithm>. Object Methods new([<attribute> => value, ...]) Creates t...

• Algorithm::QuineMcCluskey::Util - provide utility functions to Algorithm::QuineMcCluskey
• Algorithm::QuineMcCluskey::Format - provide formatting functions to Algorithm::QuineMcCluskey

This Perl package exports functions that numerically approximate first and second order differentiation on vectors of data. The accuracy of the approximation will depend upon the differences between the successive values in the X array. FUNCTIONS The...

Continued fractions are expressions of the form b1 a1 + ------- b2 a2 + ------- b3 a3 + ------- ... For most instances, the 'b' terms are 1, and the continued fraction can be written as "[a1, a2, a3, ...]", etc. If the sequence of 'a' terms ends at a...

This module provides and exports some mathematical functions which are built in in Fortran but not in Perl. Currently there are only 2 included. FUNCTIONS log10() Log to the base of 10 sign() With 1 parameter, +1 if $y >= 0, -1 otherwise. With 2 para...