BonzaiThePenguin/WikiSort

Health v2 · maintenance only

Flags: no_releases

Adoption not part of the score

1290 stars · 92 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

WikiSort is a public domain implementation of block merge sort, a stable sorting algorithm that runs in O(1) memory while remaining as fast as a standard merge sort. It is available in C, C++, and Java, with optional extra memory buffers to improve speed.

Use cases

• sort large arrays with constant memory overhead
• stable in-place sorting in C++ without std::stable_sort allocations
• embed a memory-constrained sort in embedded or low-memory environments
• study or extend block merge sort research
• benchmark in-place merge sort against standard library sorts

When to choose

• you need stable sorting with O(1) auxiliary memory
• you want fast, license-free (public domain) sorting code in C, C++, or Java
• you can supply a small cache buffer to boost performance

When to avoid

• you just need a general-purpose sort and memory usage is not a concern - standard library sorts are simpler
• you need a maintained library with active development
• you need parallel or GPU-accelerated sorting

Facets

library · maturity maintenance

math developer-tools performance developer-tools cpp c jvm cross-platform sorting block-merge-sort in-place-sort stable-sort public-domain o1-memory algorithms

Member repositories

For agents

markdown · JSON · MCP: product_card(name="BonzaiThePenguin/WikiSort")