factorial time

RU: факториальное время

A time complexity class O(n!) where the number of operations grows as the factorial of the input size. Generating all permutations of n elements and brute-force solutions to the Travelling Salesman Problem are canonical examples; the class is worse than exponential time.