A non-standard, fractal-inspired sorting algorithm with adaptive multi-pivot partitioning and k-way heap merging. Achieves near O(n log log n) performance in ideal cases.
data-structures partitioning sorting-algorithm algorithm-design data-partitioning adaptive-algorithms recursive-sorting multi-pivot asymptotic-complexity custom-sort fractal-algorithm advanced-sorting heap-merge math-inspired loglogn pivot-sampling nonstandard-algorithms experimental-algorithms
-
Updated
Mar 20, 2025 - HTML