Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Heap Sort
Linear Search
Binary Search
Jump Search
BST Insert
BST Search
In-order Traversal

Breadth-First Search
Depth-First Search
Dijkstra's Shortest Path
Prim's MST
Kruskal's MST
Topological Sort (Kahn's)
Tower of Hanoi
N-Queens
Permutations (Backtracking)
Fibonacci (DP)
0/1 Knapsack
Longest Common Subsequence
Coin Change (Min Coins)

Hill Climbing
Simulated Annealing
Differential Evolution

Q-Learning

Genetic Algorithm
Particle Swarm Optimization
Ant Colony Optimization

Monte Carlo Simulation

Placeholder — future integration.

"The invisible architecture through which intelligence becomes impact."

02Reasoning·Greedy Growth

Prim's MST

⏱ O(E log V)◧ O(V)

Step 1 / 14

Speed

Speed

02Reasoning

Prim's MST

Greedy Growth

Grow a tree by adding the cheapest crossing edge.

Time

O(E log V)

Space

O(V)

Applications

Utility network design
Cluster analysis
Approximation of TSP

Reasoning Trace

Prim's: start from A

Principle in Pseudocode

1tree = {src}
2while tree != V:
3 pick min edge crossing tree
4 add its endpoint

Reference implementation · python

tree = {src}
while len(tree) < len(V):
  u, v, w = min((u, v, w) for u in tree for v, w in adj[u] if v not in tree)
  tree.add(v); mst.append((u, v))