🔮 🔈 Visual Sorting (aka "The Sound Of Sorting") is a tool that provides a visualization of sorting algorithms, accompanied by an auditory experience.

State of the art sorting and segmented sorting, including OneSweep. Implemented in CUDA, D3D12, and Unity style compute shaders. Theoretically portable to all wave/warp/subgroup sizes.

High performance algorithms in C#: SIMD/SSE, multi-core and faster

A fast string sorting algorithm (MSD radix sort)

Generic algorithms and data structures for Lazarus/Free Pascal

То, чего нет в Бусте

Splatter is a WebGPU based gaussian splatting engine written in Rust

A compute shader implementation of the OneSweep sorting algorithm.

WebGPU implementation for the radix sort algorithm as described in the paper "Fast 4-way parallel radix sorting on GPUs"

GPU Radix Sort implemented in Vulkan and GLSL.

A radix sorting library for Go (golang)

Mmap radix sort file by a fixed length prefix of each line

Fast in-place radix sort with STL-like API

Radix sorting from the ground up

42 school project pushswap using radix sort

Radix sort. A high performence Cross-platform (parallel) STL-like LSD radix sort algorithm by C++20, 2.5-14.3x faster than std::sort, support user-defined struct.

Radix sort implementation for sorting by scalar keys (integers, floats, chars, bools)

Ready to use RadixSort and other parallel primitives for OpenGL 4.6

Faster sorting algorithms (sort and sortperm) for Julia

Sorting algorithm source codes + ultimate test to compare the performance of all algorithms. For my HappyCoders.eu article.