Integrated strategy for generating permutation
An integrated strategy for generating permutation is presented in this paper. This strategy involves exchanging two consecutive elements to generate the starter sets and then applying circular and reversing operations to list all permutations. Some theoretical works are also presented.
Saved in:
Main Authors: | Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda |
---|---|
Format: | Article |
Language: | English |
Published: |
Hikari Ltd
2011
|
Subjects: | |
Online Access: | http://repo.uum.edu.my/3489/1/ka.pdf http://repo.uum.edu.my/3489/ http://www.m-hikari.com/ijcms-2011/21-24-2011/karimIJCMS21-24-2011.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Comparison between starter sets generation method for listing all permutations
by: Karim, Sharmila, et al.
Published: (2013) -
New recursive circular algorithm for listing all permutations
by: Karim, Sharmila, et al.
Published: (2014) -
New Permutation Generation Under Exchange Strategy (PGuES)
by: Karim, Sharmila, et al.
Published: (2013) -
Improvement of parallel strategy for listing all permutations using starter sets
by: Karim, Sharmila, et al.
Published: (2014) -
New algorithm for listing all permutations
by: Ibrahim, Haslinda, et al.
Published: (2010)