Algorithms
Classic computer science algorithms from greedy and divide-and-conquer to dynamic programming and shortest path.
5 posts
-
AlgorithmsDynamic Programming
Dynamic programming explained through the Fibonacci sequence using memoization and tabulation to avoid redundant computations.
-
AlgorithmsShortest Path: Dijkstra's Algorithm
A walkthrough of Dijkstra's greedy shortest-path algorithm, foundation behind Google Maps routing, with step-by-step explanation.
-
AlgorithmsDivide and Conquer
The divide and conquer algorithm paradigm explained: breaking problems into subproblems, solving them recursively, and combining results.
-
AlgorithmsGreedy Algorithms
An introduction to greedy algorithms, a problem-solving paradigm that makes locally optimal choices to seek a global optimum, with examples and limitations.
-
AlgorithmsStructure of the web
Exploring the bowtie structure of the web, how directed graph analysis reveals the web's giant strongly connected component and its IN/OUT regions.