Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Next revision Both sides next revision
en:m_permutations_of_n_using_johnson_trotter_algorithm_on_vbscript [2018/05/25 08:51]
2SRTVF
en:m_permutations_of_n_using_johnson_trotter_algorithm_on_vbscript [2018/05/25 09:11]
2SRTVF
Line 1: Line 1:
-==== How to create m-permutations of n without ​repetitions ​on VBScript, using the Johnson-Trotter algorithm ====+==== How to create m-permutations of n as sequences ​without ​repetition ​on VBScript, using the Johnson-Trotter algorithm ====
 \\  \\ 
-При создании ​[[https://​en.wikipedia.org/​wiki/​Permutation#​k-permutations_of_n|m-перестановок из n]] использовался  ​[[https://​en.wikipedia.org/​wiki/​Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm|алгоритм Джонсона-Троттера]].\\ +[[https://​en.wikipedia.org/​wiki/​Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm|The Johnson–Trotter algorithm]] was used to create ​[[https://​en.wikipedia.org/​wiki/​Permutation#​k-permutations_of_n|m-permutations of n]].\\ 
  
 Источником n чисел является xml файл, NumberSetting.xml.\\ ​ Источником n чисел является xml файл, NumberSetting.xml.\\ ​
  • en/m_permutations_of_n_using_johnson_trotter_algorithm_on_vbscript.txt
  • Last modified: 2018/06/27 22:23
  • by 2SRTVF