Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Journal of System and Computer Engineering

Implementation of Fisher-Yates Shuffle Algorithm in Mobile-Based Vocabulary Learning Game for Children with Disabilities nasir, khaidir rahman; Tamra, Tamra; H, Muhammad Rizal; Wanita, First; Mursalim, Mursalim
Journal of System and Computer Engineering Vol 7 No 2 (2026): JSCE: April 2026
Publisher : Universitas Pancasakti

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.61628/jsce.v7i2.2479

Abstract

Children with disabilities face significant challenges in vocabulary acquisition, necessitating the development of specialized educational technologies that accommodate their unique learning characteristics. This study aims to implement the Fisher-Yates shuffle algorithm in a mobile-based vocabulary learning game specifically designed for children with disabilities, ensuring unbiased randomization of educational content to promote authentic vocabulary comprehension. This research employed the Multimedia Development Life Cycle methodology, encompassing concept definition, design, material collection, assembly, testing, and distribution phases. The Fisher-Yates shuffle algorithm was implemented following the modern Durstenfeld variant, operating through backward iteration, generating random indices, and performing in-place element swapping. Algorithm validation was conducted through simulation calculations and chi-square goodness-of-fit statistical testing across ten thousand randomization trials. The application "Tebak Kosakata" successfully integrates the randomization algorithm with an accessible user interface, featuring multimodal content presentation, immediate positive feedback mechanisms, and cumulative scoring systems. Simulation calculations confirmed that each vocabulary item maintains an equal probability for occupying any position in the final sequence. Statistical validation yielded a chi-square value of 8.47 with nine degrees of freedom and a probability value of 0.487, confirming uniformly distributed randomization without detectable bias. The algorithm achieves optimal computational efficiency with linear time complexity and constant auxiliary space complexity. The randomization of question sequences and answer option positions effectively prevents pattern-based response strategies, encouraging authentic vocabulary learning rather than positional memorization. This study establishes that the Fisher-Yates shuffle algorithm constitutes an effective mechanism for implementing unbiased randomization in educational games for children with disabilities, bridging computational algorithm theory with special education pedagogy while providing a replicable methodological framework for future development.