New Recursive Circular Algorithm for Listing All Permutations

  • Sharmila Karim College of Art and Sciences, Universiti Utara Malaysia, 06010 Sintok, Kedah, Malaysia
  • Zurni Omar College of Art and Sciences, Universiti Utara Malaysia, 06010 Sintok, Kedah, Malaysia
  • Haslinda Ibrahim College of Art and Sciences, Universiti Utara Malaysia, 06010 Sintok, Kedah, Malaysia
  • Khairil Iskandar Othman Mathematics Department, Faculty of Information Technology and Quantitative Sciences, Universiti Teknologi MARA, 40450 Shah Alam, Selangor, Malaysia
  • Mohamed Suleiman Mathematics Department, Faculty of Science, Universiti Putra Malaysia, 43400 UPM Serdang, Selangor, Malaysia
  • Mohamed Suleiman Mathematics Department, Faculty of Science, Universiti Putra Malaysia, 43400 UPM Serdang, Selangor, Malaysia

Abstract

In this paper, a new algorithm for generating permutation based on the starter sets under circular operations is presented. Once the starter sets are obtained, the circular and reverse of circular operation are employed to produce distinct permutation from each starter sets.

Published
2010-12-30
How to Cite
KARIM, Sharmila et al. New Recursive Circular Algorithm for Listing All Permutations. Menemui Matematik (Discovering Mathematics), [S.l.], v. 32, n. 2, p. 51-56, dec. 2010. ISSN 0126-9003. Available at: <https://myjms.mohe.gov.my/index.php/dismath/article/view/13743>. Date accessed: 21 may 2022.
Citation Formats
Issue
Vol 32 No 2 (2010): Menemui Matematik (Discovering Mathematics)
Section
Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.