title: Example of a factorial time algorithm O( n! )
body: <p>I'm studying time complexity in school and our main focus seems to be on <em>polynomial time</em> <code>O(n^c)</code> algorithms and <em>quasi-linear time</em> <code>O(nlog(n))</code> algorithms with the occasional <em>exponential time</em> <code>O(c^n)</code> algorithm as an example of run-time perspective. However, dealing with larger time complexities was never covered.</p>
  
  <p>I would like to see an example problem with an algorithmic solution that runs in <em>factorial time</em> <code>O(n!)</code>. The algorithm may be a naive approach to solve a problem but cannot be artificially bloated to run in factorial time.</p>
  
  <p>Extra street-cred if the factorial time algorithm is the best known algorithm to solve the problem.</p>