New recursive circular algorithm for listing all permutations
Linear array of permutations is hard to be factorised. However, by using a starter set, the process of listing the permutations becomes easy. Once the starter sets are obtained, the circular and reverse of circular operations are easily employed to produce distinct permutations from each starter set...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universiti Putra Malaysia Press
2014
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/40552/1/40.%20New%20Recursive%20Circular%20Algorithm%20for%20Listing%20All%20Permutations.pdf http://psasir.upm.edu.my/id/eprint/40552/ http://www.pertanika.upm.edu.my/Pertanika%20PAPERS/JST%20Vol.%2022%20%281%29%20Jan.%202014/03%20Page%2025-34%20%28JST%200226-2010%29.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
http://psasir.upm.edu.my/id/eprint/40552/1/40.%20New%20Recursive%20Circular%20Algorithm%20for%20Listing%20All%20Permutations.pdfhttp://psasir.upm.edu.my/id/eprint/40552/
http://www.pertanika.upm.edu.my/Pertanika%20PAPERS/JST%20Vol.%2022%20%281%29%20Jan.%202014/03%20Page%2025-34%20%28JST%200226-2010%29.pdf