Why is the brute-force approach less ideal here?

Question

Why is the brute-force approach less ideal here?

Option A — Correct answer

Trying every order grows factorially.

Option B

It is always constant time

Option C

It avoids graph traversal entirely

Option D

It works only on sorted arrays

Explanation

Trying every order grows factorially.

Course Schedule - Topological Sort Pattern Practice Quiz