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

php - regexp cyrillic filename not matches -

c# - OpenXML hanging while writing elements -

sql - Select Query has unexpected multiple records (MS Access) -