An extremely-fast, space-constrained sorting algorithm with both stable and unstable variants that replace all variants of Insertion Sort.
-
Updated
Jul 31, 2025 - C
An extremely-fast, space-constrained sorting algorithm with both stable and unstable variants that replace all variants of Insertion Sort.
GhostSort offers a fast, in-place sorting solution with stable and unstable variants. Ideal for developers seeking efficient sorting without extra memory. 🌟💻
Add a description, image, and links to the unstable-sort topic page so that developers can more easily learn about it.
To associate your repository with the unstable-sort topic, visit your repo's landing page and select "manage topics."