Example of a factorial time algorithm O( n! )

Question

I\'m studying time complexity in school and our main focus seems to be on polynomial time O(n^c) algorithms and quasi-linear time O(nlog

Answer 1

Generate all the permutations of a list

You have n! lists, so you cannot achieve better efficiency than O(n!).