Group Order Shuffler-ICOM 5047

  • Bit & Bytes
  • DinoTech
  • EitherWare
  • Electrolarinx
  • FOREST
  • HYDRAC
  • MGJ_Software
  • PR_Design
  • WebDevColegial


The Fisher-Yates Shuffle algorithm was implemented in this solution. From wikipedia:

"The basic process of Fisher-Yates shuffling is similar to randomly picking numbered tickets out of a hat, or cards from a deck, one after another until there are no more left. What the specific algorithm provides is a way of doing this numerically in an efficient and rigorous manner that, properly done, guarantees an unbiased result."