⚡ Overflow Sort

Overflow Sort is a novel, high-performance sorting algorithm developed by Scott Douglass at SynaptechLabs.

It exploits integer overflow behavior on modern hardware to rapidly sort numeric arrays using only multiplication and bit-level effects, often outperforming traditional methods like qsort and even radix sort on specific workloads.

🚀 Features

• Hardware-efficient design (leverages native overflow)
• SIMD/AVX variants for ultra-fast sorting
• Includes full benchmark suite vs qsort and radix sort
• MIT Licensed

📊 Benchmark Snapshot

10M integers sorted:
  Overflow Sort:    0.68s
  qsort (glibc):    1.08s
  Radix Sort:       0.057s
  

Full source code, benchmarks, and documentation are available on GitHub.