High performance algorithms in C#: SIMD/SSE, multi-core and faster
-
Updated
Feb 12, 2024 - C#
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.
Mmap radix sort file by a fixed length prefix of each line
OneSweep, implemented in CUDA, D3D12, and Unity style compute shaders. Theoretically portable to all wave/warp/subgroup sizes.
Fast in-place radix sort with STL-like API
Radix sorting from the ground up
GPU Radix Sort implemented in Vulkan and GLSL.
Faster sorting algorithms (sort and sortperm) for Julia
openMP implementation of parallel bitonic sort
Ready to use RadixSort and other parallel primitives for OpenGL 4.6
Sorting algorithm source codes + ultimate test to compare the performance of all algorithms. For my HappyCoders.eu article.
Julia and Python search algorithm implementation including Bloom Filter, Aho-Corasick, Boyer-Moore, Knuth-Morris-Pratt, Rabin-Karp, Binary & Sequential; hash algorithm implementation including Fowler-Noll-Vo-1, Jenkins One-at-a-time, Hash Chaining, Linear Probing & Quadratic Probing; sort algorithm implementation including Cocktail, Bitonic, Gno…
WebGPU implementation for the radix sort algorithm as described in the paper "Fast 4-way parallel radix sorting on GPUs"
Radix set/map implementation
Radix sort implementation for sorting by scalar keys (integers, floats, chars, bools)
Add a description, image, and links to the radix-sort topic page so that developers can more easily learn about it.
To associate your repository with the radix-sort topic, visit your repo's landing page and select "manage topics."