Time complexity for finding all permutations of a number

1

can anyone please tell me that

What is Time complexity for finding all permutations of a number?

What is Time complexity for finding all permutations of a string?

2

The time complexity for finding all permutations of a string of length n is O(n!). Similarly for a number, n = number of digits in number.

3

finding all permuations and printing them takes O(n! * n) time.

Am I correct or wrong?

4

its just n! i guess use next_permutation in C++

1 Like
5

If you just want to find all permutation of a string , then it can be done in O(n!) . But if you also want to print/traverse that permutation , it can be done in O(n!*n) because printing/traversing would require O(n) time.