Array full-arrangement output algorithm implemented by JS

Array full-arrangement output algorithm implemented by JS

This article mainly introduces the array full-arrangement output algorithm implemented by JS. The example analyzes the principle of full-arrangement and related javascript implementation skills, which has some reference value. If you need it, you can refer

 

 

The example in this article describes the array full-arrangement output algorithm implemented by JS. Share it with you for your reference. The specific analysis is as follows:

This js code is used to output the array in full order, improving some old code.
M (m ≤ n) elements from n different elements are arranged in a certain order, which is called an arrangement of m elements from n different elements. When m = n, all data is arranged in full order.

?

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

Function permute (input ){ Var permArr = [], UsedChars = []; Function main (input ){ Var I, ch; For (I = 0; I <input. length; I ++ ){ Ch = input. splice (I, 1) [0]; UsedChars. push (ch ); If (input. length = 0 ){ PermArr. push (usedChars. slice ()); } Main (input ); Input. splice (I, 0, ch ); UsedChars. pop (); } Return permArr } Return main (input ); }; Console. log (permute ([5, 3, 7, 1]);

I hope this article will help you design javascript programs.