Data structures
Build a practical understanding of data structures from the underlying principles.
GROUND · 6 ARTICLES
Computer Science
Study the principles that outlast frameworks and connect data structures, processes, memory, concurrency, and distributed systems to real program behavior.
Topic map
What this topic covers
Operating systems
Build a practical understanding of operating systems from the underlying principles.
Memory
Build a practical understanding of memory from the underlying principles.
Concurrency and distributed systems
Build a practical understanding of concurrency and distributed systems from the underlying principles.
Start here
New here? Start with these
A guided path from fundamentals to the next step.
Stack vs Heap: Where Variables Live (Swift Value Types)
The stack is cleaned up with function calls, while the heap supports dynamic lifetimes and sizes. This covers allocation costs, the actual placement of Swift value and reference types, and how these areas differ from the Stack and Heap data structures.
Read article
Processes vs. Threads: The Interview Essential
Open Task Manager and you see processes; read developer docs and threads come up. Both seem like “something that runs,” but what exactly sets them apart?
Read article
Heap and Priority Queue: A Complete Guide to Building Trees with Arrays
The data-structure heap shares only its name with the memory heap. This guide covers its rules for retrieving the minimum without sorting everything, index calculations for representing trees in arrays, and the role of priority queues in practice.
Read articleAll articles
All articles
What Is Idempotency, and Why It Makes Double-Clicking Pay Safe
Idempotency means producing the same result when the same request is sent multiple times. This covers why it matters with network failures and retries, the difference between GET, PUT, DELETE, and POST, and how to implement an Idempotency-Key.
Read articleConcurrency vs. parallelism: why concurrency works even on a single core
Concurrency is about structuring work across multiple tasks, while parallelism is about hardware executing tasks at the same time. This article explains why concurrency works on a single core and what Swift Concurrency means.
Read articleStacks and Queues: Why Swift Has No Stack Type
A stack removes data in LIFO order; a queue uses FIFO. This article explains why Swift has no dedicated Stack, how to build one with Array, and the performance trap caused by removeFirst in queues.
Read article