Description: Generating n digital ortho exchange method utilizing all n! Permutations. Given a positive integer n, then n numbers 1 to n which may constitute n! Permutations. Ortho arrangement swap method is that all n! Order of the units of one kind, are arranged such that each two adjacent positions are interchanged only two adjacent numbers occurred.
To Search:
File list (Check if you may need any files):
题目说明.txt
邻位互换.cpp
Download