Why is the brute-force approach less ideal here?
Practice this question from Union Find Components - Disjoint Set Pattern Practice Quiz, with options and an explanation.
Question
Why is the brute-force approach less ideal here?
Option A — Correct answer
It recomputes traversal after every edge.
Option B
It is always constant time
Option C
It avoids graph traversal entirely
Option D
It works only on sorted arrays
Explanation
It recomputes traversal after every edge.