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 Union

Kruskal's MST

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

Step 1 / 22

Speed

Speed

02Reasoning

Kruskal's MST

Greedy Union

Add cheapest edges that don't form a cycle.

Time

O(E log E)

Space

O(V)

Applications

Sparse-graph MST
Circuit design
Image segmentation

Reasoning Trace

Sort edges by weight

Principle in Pseudocode

1sort edges by weight
2for (u,v,w) in edges:
3 if find(u) != find(v):
4 union(u,v); add to MST

Reference implementation · python

edges.sort(key=lambda e: e[2])
for u, v, w in edges:
  if find(u) != find(v):
    union(u, v); mst.append((u, v, w))