🌳 Data Structures - hello · Scour

Quickheap: the fastest comparison-based heap? 🎰Treap

curiouscoding.nl·1d

Near-Optimal Heaps and Dijkstra on Pointer Machines 🎰Treap

What are skiplists good for (HN) ⏭️Skip Lists

news.ycombinator.com·16h·Hacker News

Log-Structured Merge (LSM) tree 🌲LSM Trees

gemsofcoding.com·4h·r/programming

Issue 334 - ArrayList vs LinkedList Puzzle 🔲Loop Tiling

javaspecialists.eu·1d

Linear vs Binary Search: 1M Element Speed Test Results ⚖️Y-Fast Tries

tildalice.io·21h

Getting Started Hash-Based Data Structures in Rust. 🦀Rust

·3d

talloc (3) Linux Manual Page 🔬Valgrind Tools

systutorials.com·17h

Algorithms in Java Series ⏭️Skip Lists

baeldung.com·1d

Show HN: Ghidora build system, An nx/Bazel alternative 🔨Bazel

ghidora.hyperforge.in·2h·Hacker News

Restartable sequences, TCMalloc, and Hyrum's Law 🧠Memory Models

·22h

Show HN: 1990s Game Dev Algorithms for Distributed Systems 🔺Delta Lake

docs.merca.earth·2d·Hacker News

Small educational project: hash table over HTTP written in C #️⃣Hash Tables

github.com·4d·r/C_Programming

Animated Logical Graphs • 1 📊Datalog

stream.syscoi.com·21h

Understanding when high availability infrastructure becomes a bottleneck ⚖️Load Balancing

binadit.com·4h·DEV

Can a Chip That Loves Zeros Make Huge AI Models More Efficient? 🚀Intel ISPC

spectrum.ieee.org

·2d·Hacker News, r/hardware

What exactly is cyclomatic complexity? 🔬Static Analysis

Best practices for hashing variable-length data structures #️⃣Perfect Hashing

dynatrace.com·6d

Design an in-memory database with TTL and backups 🧠Memory Models

prachub.com·1d

Building an AI-Powered Prediction Engine for Racing Data: A Developer's Journey 📱Edge AI

altilineverir.com.tr·13h·DEV

Log in to enable infinite scrolling