complexity theory - Example of a factorial time algorithm O( n! ) -
i'm studying time complexity in school , our main focus seems on polynomial time algorithms , quasi-linear time algorithms occasional exponential time algorithm example of run-time perspective. however, dealing larger time complexities never covered.
i see example problem algorithmic solution runs in factorial time . algorithm may naive approach solve problem cannot artificially bloated run in factorial time.
extra street-cred if factorial time algorithm best known algorithm solve problem.
generate permutations of list
you have n!
lists, cannot achieve better efficiency o(n!)
.
Comments
Post a Comment