Six fully-arranged JavaScript algorithms _ javascript skills

This article introduces the following six algorithms in full arrangement: exchange algorithms, link algorithms, and backtracking algorithms. If you need them, you can refer to the time complexity of full arrangement: O (n !) I gave a lecture to the students two days ago and accidentally thought about this question. I came back and summarized that seven algorithms can be used to solve the problem. Among them, dynamic loops are similar to backtracking algorithms, which are cumbersome to implement, therefore, we have summarized six types to serve readers. All algorithms are written in JavaScript and can be run directly.
Algorithm 1: Exchange (recursion)

The Code is as follows:

Full Permutation (Recursive Swap)-Mengliao Software

Full Permutation (Recursive Swap)

Mengliao Software Studio-Bosun Network Co., Ltd.

2011.05.24