blitsort

scandum

Blitsort is an in-place stable adaptive rotate mergesort / quicksort.

c algorithm

View on GitHub

716 Stars

16 Forks

13 Watchers

C Language

unlicense License

100 SrcLog Score

Cost to Build

$1.63M

Market Value

$3.32M

How is this calculated?

Growth over time

8 data points · 2023-03-01 → 2026-11-01

Stars Forks Watchers

💬

How do you feel about this project?

Ask AI about blitsort

Question copied to clipboard

What is the scandum/blitsort GitHub project? Description: "Blitsort is an in-place stable adaptive rotate mergesort / 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.

scandum/blitsort on SrcLog (arcade style)

scandum/blitsort on SrcLog (terminal style)

scandum/blitsort on SrcLog (medal style)

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

How to clone blitsort

Clone via HTTPS

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

Clone via SSH

[email protected]:scandum/blitsort.git

Download ZIP

Download main.zip

Found an issue?

Report bugs or request features on the blitsort issue tracker:

Open GitHub Issues

Similar to blitsort

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