https://github.com/alessandroconti11/sorting_network
In this repository you can find the implementation of some sorting networks.
https://github.com/alessandroconti11/sorting_network
2d-array 2d-odd-even-transposition-sort 3n-sort 3n-sort-of-schnorr-and-shamir 4-way-mergesort adapted-bitonic-sort array bitonic-sort cpp ls3-sort odd-even-merge-sort odd-even-transposition-sort shearsort sorting sorting-network
Last synced: about 2 months ago
JSON representation
In this repository you can find the implementation of some sorting networks.
- Host: GitHub
- URL: https://github.com/alessandroconti11/sorting_network
- Owner: AlessandroConti11
- License: mit
- Created: 2025-03-19T15:12:28.000Z (2 months ago)
- Default Branch: master
- Last Pushed: 2025-04-03T12:07:25.000Z (about 2 months ago)
- Last Synced: 2025-04-03T13:24:03.979Z (about 2 months ago)
- Topics: 2d-array, 2d-odd-even-transposition-sort, 3n-sort, 3n-sort-of-schnorr-and-shamir, 4-way-mergesort, adapted-bitonic-sort, array, bitonic-sort, cpp, ls3-sort, odd-even-merge-sort, odd-even-transposition-sort, shearsort, sorting, sorting-network
- Language: C++
- Homepage:
- Size: 51.8 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Sorting_Network
Author: Alessandro Conti - [AlessandroConti11](https://github.com/AlessandroConti11)
License: [MIT license](LICENSE).
Tags: `#2D-array`, `#2D_odd-even_transposition_sort`, `#3n_sort`, `#3n_sort_of_Schnorr_and_Shamir`, `#4-way_mergesort`, `#adapted_bitonic_sort`, `#array`, `#bitonic_sort`, `#c++`, `#cpp`, `#LS3_sort`, `#odd-even_mergesort`, `#odd-even_transposition_sort`, `#rotatesort`, `#shearsort`, `#sorting`, `#sorting_network`.
## Specification
In this repository you can find the implementation of some sorting networks.
A **Sorting Network** is a comparator network that sorts all input sequences.
Sorting networks are special cases of general sorting algorithms, since all comparisons are data-independent.
This makes sorting network suitable for the implementation in hardware or in parallel processor arrays, sorting on two-dimensional processor arrays.
The implemented sorting networks are:
- [odd-even transposition sort](odd-even_transposition_sort/README.md)
- [odd-even mergesort](odd-even_mergesort/README.md)
- [bitonic sort](bitonic_sort/README.md)
- [adapted bitonic sort](adapted_bitonic_sort/README.md)
- [LS3 sort](ls3_sort/README.md)
- [4-way mergesort](4-way_mergesort/README.md)
- [rotatesort](rotatesort/README.md)
- [3n sort of Schnorr and Shamir](3n_sort_Schnorr_and_Shamir/README.md)
- [2D odd-even transposition sort](2D_odd-even_transposition_sort/README.md)
- [shearsort](shearsort/README.md).
## How to run
The steps below refer to a Unix environment, for other environments the commands may change.
0. install gcc
```bash
sudo apt-get install gcc
```
1. compile each source file into an object file
```bash
g++ -std=c++20 -Wall -Werror -Wextra -O2 -c FILE.cpp -o FILE.o
```
2. link all object files into an executable
```bash
g++ -std=c++20 -Wall -Werror -Wextra -O2 main.o \
odd-even_transposition_sort/odd-even_transposition_sort.o \
odd-even_mergesort/odd-even_mergesort.o \
bitonic_sort/bitonic_sort.o \
adapted_bitonic_sort/adapted_bitonic_sort.o \
ls3_sort/ls3_sort.o \
4-way_mergesort/4-way_mergesort.o \
rotatesort/rotatesort.o \
3n_sort_Schnorr_and_Shamir/3n_sort_Schnorr_and_Shamir.o \
2D_odd-even_transposition_sort/2D_odd-even_transposition_sort.o \
shearsort/shearsort.o \
-o EXECUTABLE
```
3. run the executable
```bash
./EXECUTABLE
```
The Makefile in the repository can also be used to compile the code.
- this option allows you to compile with the following tags: *-std=c++20 -Wall -Werror -Wextra -O2*
```bash
make
```
- if you want to specify different tags, you can set them
```bash
make compile CXXFLAGS=YOUR_FLAGS
```
- if you want to remove all .o files and the final executable
```bash
make clean
```
The CMakeLists.txt in the repository can also be used to compile the code.
0. install cmake
```bash
sudo apt-get install cmake
```
1. create the build folder
```bash
mkdir build && cd build
```
2. generate compilation files
```bash
cmake ..
```
3. build the project
```bash
cmake --build .
```
4. run the executable
```bash
./sorting_network
```
## Contribute
- If you find a security vulnerability, do NOT open an issue. Email [Alessandro Conti](mailto:[email protected]) instead.
- If you find a bug or error or want to add some other function that is not implemented yet
1. **FORK** the repo
2. **CLONE** the project to your own machine
3. **COMMIT** to your own branch
4. **PUSH** your work back up to your fork
5. submit a **PULL REQUEST** so that I can review your changes
> NOTE: Be sure to merge the latest from "upstream" before making a pull request!
### Code Style
Each new function must be documented using the following style:
- *Short function description*: A brief description explaining what the function does.
- *@warning*: A section listing all the assumptions made by the function, such as the preconditions that the parameters must fulfil.
- *Blank line*: Add a blank line to separate the documentation sections.
- *@details*: A detailed section describing how the function works, explaining the algorithms and logic used.
- *Blank line*: Add a blank line to separate the documentation sections.
- *@param*: A list of the parameters required by the function, each accompanied by a brief description of its role and type.
- *@return*: A description of what the function returns, including the data type.
In general, any additional comments that might improve understanding of the code are welcome. 😃