Interactive Demos

These demos are meant to be edited and run directly in the docs.

• Factorial — classic recursion over natural numbers
• Fibonacci — recursive sequence generation
• Merge Sort — classic divide-and-conquer sorting
• Binary Search Tree — insertion and lookup in a recursive ADT
• Expression Evaluator — evaluate a tiny arithmetic AST
• Dijkstra Lite — shortest-path relaxation on a tiny weighted graph
• 0/1 Knapsack — dynamic-programming row updates
• Union-Find — disjoint-set connectivity on a small graph
• Prefix Parser + Evaluator — recursive-descent parsing of prefix tokens
• Topological Sort — Kahn-style ordering on a DAG
• N-Queens — backtracking with diagonal pruning