Algorithm-Networksort

 view release on metacpan or  search on metacpan

Changes  view on Meta::CPAN

	- In the interests of code clarity, made use of q and qq operators
	  instead of quotes and escaped quotes.
	- Split the test files even further.
	- SVG colors!
	- Embedded the [from, to] pairs in an xml comment before each svg
	  command to draw comparators. Debugging aid.
	- Put a group tag around the SVG commands for the input line.
1.06	Sun Jan 16 2005
	- Made some code changes to allow running this module under
	  perl 5.005.
	- Added to the SEE ALSO section a link to Joe Celko's
	  article in dbazine.com.  Bose-Nelson in SQL!
	- Updated the link to Ian Parberry's article.
	Mon Mar 21 2005
	- Removed a redundant check for an empty network in nw_format()
	  in the default format section.
	Tue May 23 2006
	- Changed arrangement of files to default layout by Module::Build.
	- Added the Meta.yml and Build.PL files.
	- Changed test files to use Test::Simple.
	Fri Jun 2 2006
	- Added pod.t.
	- Typo fix in pod (itme instead of item).  Fixed stale links.
	- It looks like the Forbes D. Lewis article, "Sorting Networks"
	  has vanished altogether.  Removed it from the See Also section.
	Wed Jul 26 2006
	- Split the batcher.t, best.t, bn.t, and hibbard.t files into
	  two.  I'm trying to  cut down the time-to-finish length, which
	  some test environments don't handle well ("Is this test done
	  yet?  I'm bored.")
	Wed Sep 13 2006
	- Added color components, although no actual colors are set yet
	  except for 'foreground'.
	- Changed the text graph option names 'fromcomp' and 'tocomp'
	  to 'compbegin' and 'compend' to make them consistant with the

lib/Algorithm/Networksort.pm  view on Meta::CPAN

=item

Frederick Hegeman, "Sorting Networks", The C/C++ User's Journal, February 1993.

=item

Joe Celko, I<Joe Celko's SQL For Smarties> (third edition). Implementing
Bose-Nelson sorting network in SQL.

This material isn't in either the second or fourth edition of the book.

=item

Joe Celko, I<Joe Celko's Thinking in Sets: Auxiliary, Temporal, and Virtual Tables in SQL>.

The sorting network material removed from the third edition of
I<SQL For Smarties> seems to have been moved to this book.

=back

lib/Algorithm/Networksort.pm  view on Meta::CPAN

=back

=head2 Batcher's Merge Exchange algorithm.

=over 3

=item

Code for Kenneth Batcher's Merge Exchange algorithm was derived from Knuth's
The Art of Computer Programming, Vol. 3, section 5.2.2.

=back

=head2 Batcher's Bitonic algorithm

=over 3

=item

Kenneth Batcher, "Sorting Networks and their Applications", Proc. of the

lib/Algorithm/Networksort.pm  view on Meta::CPAN

=item

Dr. Hans Werner Lang has written a detailed discussion of the bitonic
sort algorithm here:
L<http://www.iti.fh-flensburg.de/lang/algorithmen/sortieren/bitonic/bitonicen.htm>

=item

T. H. Cormen, E. E. Leiserson, R. L. Rivest, Introduction to Algorithms,
first edition, McGraw-Hill, 1990, section 28.3.

=item

T. H. Cormen, E. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms,
2nd edition, McGraw-Hill, 2001, section 27.3.

=back

=head2 Algorithm discussion

=over 3

=item

Donald E. Knuth, B<The Art of Computer Programming, Vol. 3: