Expand description
SIMD-optimized sorting algorithms
This module provides vectorized implementations of sorting algorithms including quicksort, bitonic sort, and specialized sorting operations.
Functionsยง
- bitonic_
sort_ f32_ simd - Bitonic sort for power-of-2 sized arrays Optimal for small fixed-size arrays with SIMD processing
- median_
f32_ simd - SIMD-optimized median computation using quickselect
- quickselect_
f32_ simd - SIMD-optimized quickselect for k-th smallest element
- quicksort
- Generic quicksort function for raw pointer interface
- quicksort_
f32_ simd - SIMD-optimized quicksort for f32 arrays Uses vectorized partitioning and parallel processing for optimal performance