Compare Kruskal's and Prim's algorithms for Minimum Spanning Tree.

Both find MST but differ in approach. Kruskal's: sort all edges, add smallest edge that doesn't form cycle (using Union-Find). Time O(E log E). Better for sparse graphs and when edges are already sorted. Prim's: grow tree from arbitrary vertex, always add minimum edge connecting tree to non-tree vertex. Time O(E log V) with binary heap. Better for dense graphs. Both are greedy algorithms guaranteed to find MST.