交大資料結構 - 彭文志老師:
Recursive permutation
code(cpp) point
Execution Order
Suppose there is a string,ABC, that need to be permutated.
Order
Node0\( \rightarrow \) Node1\( \rightarrow \) Node2
\( \rightarrow \) Node1\( \rightarrow \) Node3
\( \rightarrow \) Node1\( \rightarrow \) Node0
\( \rightarrow \) Node4\( \rightarrow \) Node5
\( \rightarrow \) Node4\( \rightarrow \) Node6
\( \rightarrow \) Node4\( \rightarrow \) Node0
\( \rightarrow \) Node7\( \rightarrow \) Node8
\( \rightarrow \) Node7\( \rightarrow \) Node9
\( \rightarrow \) Node7\( \rightarrow \) Node0
\( \rightarrow \) return
graph
code(cpp)