What is an example (in code) of a O(n!) function? It should take appropriate number of operations to run in reference to n; that is, I\'m asking a
O(n!)
n
Any algorithm that calculates all permutation of a given array is O(N!).
O(N!)