Write a recursive function to print all permutations of given digits(1,2,3,4,...,N)

Question

Can anyone code this ?

Answer 1

i like the challenge
//will make code later ☺ (java)

Answer 2

Explanation?

Answer 3

What do you mean by "permutations'. Kindly give a sample input and expected output

Answer 4

ook

Answer 5

I meant could you explain what you want?

Answer 6

yes, please!

Answer 7

I need the code of that question

Answer 8

input: 1,2,3
output:
123
132
213
231
312
321

Answer 9

I think you want like this but it is Python and using generator. I saw it on internet.

def permu(x):
if len(x) == 1:
yield x
else:
for i in range(len(x)):
for p in permu(x[:i] + x[i+1:]):
yield [x[i]] + p

print(list(permu([1,2,3])))