DEV Community

Algorithms

Heap, Binary Tree, Data Structure it doesn't matter. This tag should be used for anything Algorithm & Data Structure focused.

Posts

👋 Sign in for the ability to sort posts by relevant, latest, or top.
I built a hash map from scratch (and now I know why dictionaries are fast)

I built a hash map from scratch (and now I know why dictionaries are fast)

Comments
4 min read
How Binary Search Works: A Quick Walkthrough with Java

How Binary Search Works: A Quick Walkthrough with Java

Comments
4 min read
Can integer arithmetic make wave calculations 10 faster?

Can integer arithmetic make wave calculations 10 faster?

Comments
3 min read
Cutting glass is not cutting wood: writing a guillotine nesting optimiser that uses the offcuts first

Cutting glass is not cutting wood: writing a guillotine nesting optimiser that uses the offcuts first

Comments
3 min read
Walls Are Edges: Closing Loops Into Rooms Without Lying About Area

Walls Are Edges: Closing Loops Into Rooms Without Lying About Area

1
Comments
7 min read
Building Sovereign Multi-Agent Orchestration & DAG State Machines in Pure Python: Kahn's Algorithm, Dynamic Routing & Checkpointing

Building Sovereign Multi-Agent Orchestration & DAG State Machines in Pure Python: Kahn's Algorithm, Dynamic Routing & Checkpointing

Comments
3 min read
I implemented Myers' diff in the browser — and my path trace cost 11 MB

I implemented Myers' diff in the browser — and my path trace cost 11 MB

Comments
8 min read
Inside the Myers Diff Algorithm: How Git Finds Code Changes (And How to Build One in Vanilla JS)

Inside the Myers Diff Algorithm: How Git Finds Code Changes (And How to Build One in Vanilla JS)

1
Comments
6 min read
Building High-Frequency Algorithmic Trading & Arbitrage Bots in Pure Python: In-Memory L2 OrderBooks, Triangular Arbitrage & Sub-4µs Execution

Building High-Frequency Algorithmic Trading & Arbitrage Bots in Pure Python: In-Memory L2 OrderBooks, Triangular Arbitrage & Sub-4µs Execution

1
Comments
4 min read
The Count-to-Infinity Bug in Network Routing: Split Horizon & Poison Reverse

The Count-to-Infinity Bug in Network Routing: Split Horizon & Poison Reverse

Comments
2 min read
How to Learn Big O Notation (and Stop Freezing When Someone Asks for the Complexity)

How to Learn Big O Notation (and Stop Freezing When Someone Asks for the Complexity)

Comments
5 min read
Three fewer graph passes, 12% more time

Three fewer graph passes, 12% more time

Comments
9 min read
Two ways to solve a maze. The faster one gives the worse answer.

Two ways to solve a maze. The faster one gives the worse answer.

1
Comments
2 min read
I ran a million Secret Santa draws through my generator. Here's what the paper hat gets wrong

I ran a million Secret Santa draws through my generator. Here's what the paper hat gets wrong

Comments
7 min read
Demystifying Graph Traversal: BFS vs. DFS and When to Use Which

Demystifying Graph Traversal: BFS vs. DFS and When to Use Which

Comments
2 min read
👋 Sign in for the ability to sort posts by relevant, latest, or top.