Computer Science·April 24, 2025
BFS vs DFS: Graph Traversal
Two ways to escape a maze. Spread out wide (BFS) or dig deep (DFS)? Who finds the shortest path?
#CS#Algorithm#Graph#Search
Writing about development and technology.
Two ways to escape a maze. Spread out wide (BFS) or dig deep (DFS)? Who finds the shortest path?
Digitized paper signature. Verify with public key, sign with private key. Unforgeable, non-repudiation. Core tech of blockchain and HTTPS.
Divide and Conquer. Slower than Quick Sort, but guarantees O(n log n).
Fast by name. Partitioning around a Pivot. Why is it the standard library choice despite O(N²) worst case?
The Big 3 of O(N²) sorting. Why Bubble Sort is banned in production? When is Insertion Sort faster than Quick Sort?
If Tree is Hierarchy, Graph is Web. Navigation and Friend Algorithm.
Binary Tree is for RAM. Disk is slow. B-Tree minimizes Disk I/O by being short and fat. Difference between B-Tree and B+Tree, and why databases love them.
Subway maps, Social Networks, Navigation. Representing relationships with Nodes and Edges.
Emergency Room Logic: Critical patients first. How Priority Queue works with O(1) access.
Corporate Hierarchy. CEO is Root, Interns are Leaves. How File System is built.
FIFO (First In First Out). From Roller Coaster lines to Message Queues (Kafka). Circular Queue, Blocking Queue for thread safety, and Deque for sliding windows.
Last In First Out (LIFO). Deep dive into Call Stack, DFS (Maze Solving), RPN Calculators, Syntax Parsing, and implementing Browser Undo/Redo.
Arrays are apartments, Linked Lists are scavenger hunts. Deep dive into Node structure, O(1) insertion, Memory Fragmentation, LRU Cache, and Circular Linked Lists.
Arrays use contiguous memory seats. Deep dive into O(1) Access formula, CPU Cache Locality, Buffer Overflow security risks, and Dynamic Array resizing logic.
O(1) vs O(N^2) decides your server's fate. Deep dive into Amortized Analysis, Master Theorem, P vs NP, and Space-Time Tradeoffs.
Doing chemistry(try), Fire!(catch), Cleanup(finally).
C's notorious barrier. Pointers directly manipulate memory addresses—powerful but dangerous. References are the safe version. The terror of Segfault and nightmare of nullptr.
Janitor cleaning up developer's mess. Convenient, but sometimes blocks the hallway (Stop The World).
Preventing Stack Overflow. Just pass the baton and go home. Why compilers love TCO.
Opening Russian Dolls. Without Base Case, it's Stack Overflow hell.
