N元集的一类排序问题的最优设计

The optimal design for a kind of sequencing problem of N-set

研究N元集的一类排序问题的最优设计,得到了N元集逆序排序所需的最少抽换次数。

The optimal design for a kind of sequencing problem of N-set is investigated, and the least substitution times of the converse ordinal of N-set is obtained. At the same time the relevant results and realization of the algorithm will appear too.