How to solve recursion dictionary order(larger)?

#1

I can’t decide how to solve recursion dictionary order(larger). I don’t know how to proceed with the problem.

#2

it is simple
As u do permutation
just in the base case u simplly cout the permutation
in this u only have to check that the permutation is bigger than the original string that is input string or not
if greater than cout the permutation if not then don’nt cout

#3

But it has been clearly stated that the obtained permutations have to be printed out in lexicographical order(according to dictionary).

#4

it is said that the permutation which is greater than the original in dictionary order HAVE TO BE COUT

#5

the order is not defined

#6

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.