Cost-Aware Maximum Finding — a threshold-based approach to reduce expensive post-processing
-
Updated
Sep 16, 2025 - Jupyter Notebook
#
experimental-algorithms
Here are 2 public repositories matching this topic...
Language: All
Filter by language
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
Improve this page
Add a description, image, and links to the experimental-algorithms topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the experimental-algorithms topic, visit your repo's landing page and select "manage topics."