The answer
Only if the problem explicitly asks for all permutations or combinations. If they ask for a shortest path or optimal solution, an O(N!) brute force is just a starting point.
Recognizing O(N!) Factorial Time Complexity
Should I write an O(N!) algorithm in an interview?
More FAQs in Recognizing O(N!) Factorial Time Complexity
It is an extreme time complexity where the operations multiply factorially (N * N-1 * N-2...), representing the absolute worst algorithmic scaling possible.
Problems that require generating all possible permutations (orderings) of a dataset, such as solving the brute-force Traveling Salesperson problem.
Yes, drastically worse. 20^2 is 400. 2^20 is 1 Million. 20! is 2.4 Quintillion.
Still have questions?
Browse all our FAQs or reach out to our support team
Want to upskill yourself?
Your learning library
Small steps. Big possibilities.
Find your next course. Build something great.