sorting_networks
Synopsis
An implementation of sorting networks in Rust.
Motivation
In computer science, comparator networks are abstract devices built up of a fixed number of "wires", carrying values, and comparator modules that connect pairs of wires, swapping the values on the wires if they are not in a desired order. Such networks are typically designed to perform sorting on fixed numbers of values, in which case they are called sorting networks. (Wikipedia)
sorting_network
provided implementations of Batcher's Odd-Even Merge-Sort for sequences of length 2
, 4
, 8
, 16
, 32
, 64
, 128
and 256
.
Example of SortingNetwork16
:
Usage
let mut items = vec!;
let network = new;
network.sort;
assert_eq!;
Contributing
Please read CONTRIBUTING.md for details on our code of conduct,
and the process for submitting pull requests to us.
License
This project is licensed under the MPL-2.0 – see the LICENSE.md file for details.