• Explore
  • Curator's Pick
  • Login
  • Sign up
stem stemsocial hive-130906 neoxian hive-196387 programming steemstem nature waiv waivio natureobserver archon science insect ecency discovery-it palnet technology flower photos ctp proofofbrain hive-111030 vyb security python amazingnature education hive-128780 math cent calculus hive scifiverse chessbrothers scifimultiverse vectors spanish 911truth physics

#zig

avatar
@scipio 0
1 day ago
StemSocial
Learn Zig Series (#121) - Topological Sort Learn Zig Series (#121) - Topological Sort What will I learn? What a topological sort actually is, why it only makes sense on a directed acyclic graph (a DAG), and how it turns "thes
21
0
0
27.094 STEM
avatar
@scipio 0
2 days ago
StemSocial
Learn Zig Series (#120) - Dijkstra and A* Learn Zig Series (#120) - Dijkstra and A* What will I learn? Why the BFS shortest path we built last episode quietly breaks the moment edges stop being equal, and why that single assumpt
13
0
0
24.469 STEM
avatar
@scipio 0
3 days ago
StemSocial
Learn Zig Series (#119) - BFS and DFS Learn Zig Series (#119) - BFS and DFS What will I learn? Why breadth-first search (BFS) and depth-first search (DFS) are secretly the same algorithm, and how…
21
0
0
27.100 STEM
avatar
@scipio 0
4 days ago
StemSocial
Learn Zig Series (#118) - Graph Representation Learn Zig Series (#118) - Graph Representation What will I learn? Why a graph is the right shape for data that is connected rather than ordered -- roads…
22
0
0
25.994 STEM
avatar
@scipio 0
5 days ago
StemSocial
Learn Zig Series (#117) - Binary Search Variations Learn Zig Series (#117) - Binary Search Variations What will I learn? Why binary search is the payoff that sorting buys you -- an unsorted array answers "is this here?" in O(n) , a sort
16
0
0
25.409 STEM
avatar
@scipio 0
6 days ago
StemSocial
Learn Zig Series (#116) - Sorting Algorithms in Zig Learn Zig Series (#116) - Sorting Algorithms in Zig What will I learn? Why sorting is a solved problem you never stop paying for -- the comparison model, the O(n log n) lower bound, an
14
0
0
23.281 STEM
avatar
@scipio 0
about 2 hours ago
StemSocial
Learn Zig Series (#122) - Union-Find Learn Zig Series (#122) - Union-Find What will I learn? What the union-find (or disjoint-set ) structure actually answers -- the deceptively simple question "are…
26
0
0
0.409 STEM
avatar
@scipio 0
8 days ago
StemSocial
Learn Zig Series (#115) - Slab Allocators Learn Zig Series (#115) - Slab Allocators What will I learn? What a slab allocator actually is -- not a new trick, but the machine episode 114 was pointing at: take the single-size memor
17
0
0
25.616 STEM
avatar
@scipio 0
9 days ago
StemSocial
Learn Zig Series (#114) - Memory Pools Learn Zig Series (#114) - Memory Pools What will I learn? Why a memory pool (a.k.a. object pool, fixed-size block allocator, or free-list allocator) is the idea episode 113 was quietly w
10
0
0
0.477 STEM
avatar
@scipio 0
10 days ago
StemSocial
Learn Zig Series (#113) - Ring Buffers: Lock-Free Learn Zig Series (#113) - Ring Buffers: Lock-Free What will I learn? Why a ring buffer (a.k.a. circular buffer) is the data structure that answers the question episode 112 ended on -- a
29
0
0
215.309 STEM
Menu
Explore Curator's Pick
Trade
Trade STEM Swap