Algorithm::Bitonic::Sort - Sorting numbers with Bitonic Sort River stage zero No dependents

Bitonic mergesort is a parallel algorithm for sorting. It is also used as a construction method for building a sorting network. This is an Perl 5 implementation of Ken Batcher's Bitonic mergesort....

BLUET/Algorithm-Bitonic-Sort-0.06 - 12 Feb 2017 16:40:46 GMT - Search in distribution

Algorithm::Networksort - Create Sorting Networks. River stage one • 1 direct dependent • 1 total dependent

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...

JGAMBLE/Algorithm-Networksort-2.02 - 21 Jun 2018 21:56:23 GMT - Search in distribution

2 results (0.052 seconds)