Constant-complexity, deterministic, very fast memory allocator (heap) for hard real-time high-integrity embedded systems. Allocation takes ≈120 cycles @ RP2350 irrespective of heap usage. There is little activity because the project is finished and does not require further changes.

Just a Bizarre Website

EngineeringPapyr is a standalone PyWebView version of EngineeringPapyer.xyz that makes it easy to create, save, and share engineering calculations.

High-performance C++ data structure for fast key-based access with guaranteed O(1) operations, dynamic resizing, and memory-efficient design

🐉 Mergesort algorithm for JavaScript

🎄 Red-black tree library for JavaScript

👇 Selection algorithms for JavaScript

⚖️ AVL trees for JavaScript

cross-chain routing engine. worst-case optimized path search across every bridge.

🐙 d-ary heap data structure library for JavaScript

🐙 Heapsort algorithm for JavaScript

MasterMind clone where the computer delays choosing the code as long as possible, while still leaving all previously given data true.

High-performance C++ data structure for fast key-based access with guaranteed O(1) operations, dynamic resizing, and memory-efficient design

Deterministic Real-Time Memory Allocator