Time complexity doubt

#1

I have a doubt regarding the time complexity of the approch .
is it O(root(n)).

#2

Hi. This code is for printing all the permutations of a number. Its time complexity is O(n*n!)

#3

In this approac basically we are swapping first 2 elments moving right by 1 index then again swapping right???

#4

We are doing it to find all the possible permutations. and total permutations of a number of length n is n!.

you can refer this for more clarity.

Hope this clears all ur doubts.

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.