Starter Set Generation Based on Factorial Numbers for Half Wing of Butterfly Representation

• Main Authors: Karim, Sharmila, Ibrahim, Haslinda
• Format: Article
• Language: English
• Published: Horizon Research Publishing 2021
• Subjects: QA Mathematics
• Online Access: https://repo.uum.edu.my/id/eprint/30801/1/MS%2009%2005%202021%20664-668.pdf; https://repo.uum.edu.my/id/eprint/30801/; https://www.hrpub.org/journals/jour_info.php?id=34

Permutation is an interesting subject to explore until today where it is widely applied in many areas. This paper presents the use of factorial numbers for generating starter sets where starter sets are used for listing permutation. Previously starter sets are generated by using their permutation under exchange-based and cycling based. However, in the new algorithm, this process is replaced by factorial numbers. The base theory is there ... number of distinct starter sets. Every permutation has its decimal number from zero until ... for Lexicographic order permutation only. From a decimal number, it will be converted to a factorial number. Then the factorial number will be mapped to its corresponding starter sets. After that, the Half Wing of Butterfly will be presented. The advantage of the use of factorial numbers is the avoidance of the recursive call function for starter set generation. In other words, any starter set can be generated by calling any decimal number. This new algorithm is still in the early stage and under development for the generation of the half wing of butterfly representation. Case is demonstrated for a new algorithm for lexicographic order permutation. In conclusion, this new development is only applicable for generating starter sets as a lexicographic order permutation due to factorial numbers is applicable for lexicographic order permutation