Representation of permutations, combinations and dihedral elements as trees

✍ Scribed by B.J. Arnow

• Publisher: Elsevier Science
• Year: 1990
• Tongue: English
• Weight: 162 KB
• Volume: 20
• Category: Article
• ISSN: 0898-1221
• DOI: 10.1016/0898-1221(90)90031-e

✦ Synopsis

Permutations and combinations of n objects as well as the elements of the dihedral group of order 2n (i.e. flips and rotation of an n-gun) are represented as nodes of trees. The algorithms for generating the nodes and traversing the trees are illustrated using flowcharts and specific walk-throughs for given values of n. Any programming language that allows recursive calls can be used to implement these algorithms.