blob: ba839af84b10c2d6adbed096ea2249e3d845ec42 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
|
This module will create sorting networks, a sequence of comparisons
that do not depend upon the results of prior comparisons.
There are several algorithms to generate sorting networks. This
module has three of them: Bose and Nelson's, Hibbard's, and
Batcher's Merge Exchange. It also has networks that were found
to be superior in comparison count to those generated automatically
by these algorithms.
There is a flexible formatting function that will allow you to
print out your network in many ways (see documentation). There
is also a graphical output function that will return the network
in an encapsulated postscript, SVG, or text form.
WWW: http://search.cpan.org/dist/Algorithm-Networksort/
|
