SEALiP: A simple and efficient algorithm for listing permutation via starter set method
Algorithm for listing permutations for n elements is an arduous task.This paper attempts to introduce a novel method for generating permutations.The fundamental concept for this method is to seek a starter set to begin with as an initial set to generate all distinct permutations. In order to demons...
Saved in:
Main Authors: | Ibrahim, Haslinda, Zake, Lugean, Omar, Zurni, Karim, Sharmila |
---|---|
格式: | Article |
语言: | English |
出版: |
Penerbit UTM Press
2013
|
主题: | |
在线阅读: | http://repo.uum.edu.my/16850/1/11.pdf http://repo.uum.edu.my/16850/ http://www.mjfas.utm.my/index.php/mjfas/article/view/108 |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
Improvement of parallel strategy for listing all permutations using starter sets
由: Karim, Sharmila, et al.
出版: (2014) -
Parallel strategy for starter sets to list all permutation based on cycling restriction
由: Karim, Sharmila, et al.
出版: (2011) -
Comparison between starter sets generation method for listing all permutations
由: Karim, Sharmila, et al.
出版: (2013) -
A new parallel model for starter sets generation via exchanging two elements
由: Karim, Sharmila, et al.
出版: (2019) -
Application of half butterfly method in listing permutation
由: Karim, Sharmila, et al.
出版: (2016)