Topic
Binary Search
Find a value in a sorted list in O(log n) by repeatedly halving the search space.
Topic
Sorting Algorithms
From bubble sort's O(n²) simplicity to merge sort's O(n log n) guarantee — how ordering data unlocks everything else.
Topic
Binary Search Trees
A tree that keeps every left descendant smaller and every right descendant larger, turning search, insert, and delete into O(log n) operations — when the tree stays balanced.
Topic
TCP Three-Way Handshake
Before any data flows, a TCP client and server exchange three segments — SYN, SYN-ACK, ACK — to agree on starting sequence numbers and confirm both sides are ready.
Topic
Graph Traversal (BFS & DFS)
Two ways to visit every reachable node in a graph — breadth-first spreads outward level by level, depth-first commits to one path and backtracks — and the queue-vs-stack choice that produces each one.
Topic
Heaps & Priority Queues
A complete binary tree, stored flat in an array, that keeps the smallest (or largest) element one O(log n) extraction away — the standard way to build a priority queue.