I
index
suppose there are n elements,how can you use recursive algorithm to
determine all of the n elements' arrangements.
for example,if there is 1 element,say, A1,there is only one
arrangement, namely,{A1};
if there are 2 elements,say,A1 and A2,there are two
arrangements,namely, {A1,A2},{A2,A1};
3 elements, A1,A2 and A3, six arrangements
exist,{A1,A2,A3},{A2,A1,A3},{A3,A1,A2},{A3,A2,A1},{A1,A3,A2},{A2,A3,A1};
.......
so if there are n elements, how can we use recursive algorithm to
determine all of these arrangements?
determine all of the n elements' arrangements.
for example,if there is 1 element,say, A1,there is only one
arrangement, namely,{A1};
if there are 2 elements,say,A1 and A2,there are two
arrangements,namely, {A1,A2},{A2,A1};
3 elements, A1,A2 and A3, six arrangements
exist,{A1,A2,A3},{A2,A1,A3},{A3,A1,A2},{A3,A2,A1},{A1,A3,A2},{A2,A3,A1};
.......
so if there are n elements, how can we use recursive algorithm to
determine all of these arrangements?