Algorithm-Networksort-Chooser

 view release on metacpan or  search on metacpan

README  view on Meta::CPAN

        $ algorithm-networksort-chooser 9 --validate  ## run 0-1 validation test
        $ algorithm-networksort-chooser 9 --show  ## show network as ASCII diagram
        $ algorithm-networksort-chooser 9 --raw  ## show network as raw comparators

DESCRIPTION
    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 known special-cases, and chooses the one that
    best meets your specified criteria.

    This module allows you to trim sorting networks into median or selection
    networks.

    You can then choose the optimal net based on comparators (total number
    of operations) or on stages (number of operations considering

README  view on Meta::CPAN

            Stages: 8
          Algorithm "bubble":
            Comparators: 36
            Stages: 15

FUTURE IDEAS
    Algorithm::Networksort::Validate::XS

SEE ALSO
    Introduction To Sorting Networks
    <http://hoytech.github.io/sorting-networks/>

    Algorithm-Networksort-Chooser github repo
    <https://github.com/hoytech/Algorithm-Networksort-Chooser>

    John Gamble's Algorithm-Networksort github repo
    <https://github.com/jgamble/Algorithm-Networksort>

AUTHOR
    Doug Hoyte, "<doug@hcsw.org>"

bin/algorithm-networksort-chooser  view on Meta::CPAN

    $ algorithm-networksort-chooser 9 --validate  ## run 0-1 validation test
    $ algorithm-networksort-chooser 9 --show  ## show network as ASCII diagram
    $ algorithm-networksort-chooser 9 --raw  ## show network as raw comparators



=head1 DESCRIPTION

This module uses L<Algorithm::Networksort> to experiment with sorting networks.

L<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 known special-cases, and chooses the one that best meets your specified criteria.

This module allows you to trim sorting networks into median or selection networks.

You can then choose the optimal net based on comparators (total number of operations) or on stages (number of operations considering parallelism).

Normally the output is something like this:

    $ algorithm-networksort-chooser --median 22

bin/algorithm-networksort-chooser  view on Meta::CPAN

=head1 FUTURE IDEAS

Algorithm::Networksort::Validate::XS



=head1 SEE ALSO

L<Introduction To Sorting Networks|http://hoytech.github.io/sorting-networks/>

L<Algorithm-Networksort-Chooser github repo|https://github.com/hoytech/Algorithm-Networksort-Chooser>

John Gamble's L<Algorithm-Networksort github repo|https://github.com/jgamble/Algorithm-Networksort>



=head1 AUTHOR

Doug Hoyte, C<< <doug@hcsw.org> >>