12 results for “topic:worst-case”
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
:dragon: Mergesort algorithm for JavaScript
:christmas_tree: Red-black tree library for JavaScript
High-performance C++ data structure for fast key-based access with guaranteed O(1) operations, dynamic resizing, and memory-efficient design
:balance_scale: AVL trees for JavaScript
:octopus: Heapsort algorithm for JavaScript
:point_down: Selection algorithms for JavaScript
:octopus: d-ary heap data structure library 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