quadsort

quadsort

scandum

Quadsort is a branchless stable adaptive mergesort faster than quicksort.

algorithm c visualization
View on GitHub
2.2k Stars
108 Forks
42 Watchers
C Language
unlicense License
100 SrcLog Score
Cost to Build
$1.53M
Market Value
$3.93M
How is this calculated?

Growth over time

13 data points  ·  2021-08-01 → 2026-11-01
Stars Forks Watchers
💬

How do you feel about this project?

Ask AI about quadsort

Question copied to clipboard

What is the scandum/quadsort GitHub project? Description: "Quadsort is a branchless stable adaptive mergesort faster than quicksort.". Written in C. Explain what it does, its main use cases, key features, and who would benefit from using it.

Question is copied to clipboard — paste it after the AI opens.

🏆 Show off this rank

scandum/quadsort on SrcLog (holo style)

Add it to a GitHub README or profile — the card updates as the ranking changes:

How to clone quadsort

Clone via HTTPS

git clone https://github.com/scandum/quadsort.git

Clone via SSH

[email protected]:scandum/quadsort.git

Download ZIP

Download master.zip

Found an issue?

Report bugs or request features on the quadsort issue tracker:

Open GitHub Issues

Similar to quadsort

neovim git the_silver_searcher ruby awesome-cpp vim FFmpeg nuklear obs-studio curl infer mpv radare2 goaccess phpredis scrcpy tig OpenRCT2 libsodium graal rufus gdbgui raspberry-pi-os lowlevelprogramming-university Pillow mal reactos lwan hashcat kotlin-native