big o - Which algorithms have time complexity greater than O(n!)? -


i know problems such finding permutations of given set of symbols o(n!) algorithm. curious find instance of algorithm has greater time complexity this.

there shall many such problems possible.

for example, if there n objects , n destinations , each object can go destination (repetitions allowed), there shall o(n^n) possibilities.


Comments

Popular posts from this blog

html - Sizing a high-res image (~8MB) to display entirely in a small div (circular, diameter 100px) -

java - IntelliJ - No such instance method -

identifier - Is it possible for an html5 document to have two ids? -