Binar Shuffle Algorithm: Shuffling Bit by Bit
William F. Gilreath

TL;DR
The paper introduces the Binar Shuffle Algorithm, a linear O(N) method for shuffling data that uses data encoding and parameterization to avoid reliance on pseudo-random number generators, ensuring effective randomization.
Contribution
It presents a novel shuffling algorithm that employs data encoding and parameterization to achieve efficient, unbiased random permutations without depending on pseudo-random number generators.
Findings
Achieves linear O(N) complexity for shuffling.
Avoids bias towards sorted permutations.
Independent of pseudo-random number generators.
Abstract
Frequently, randomly organized data is needed to avoid an anomalous operation of other algorithms and computational processes. An analogy is that a deck of cards is ordered within the pack, but before a game of poker or solitaire the deck is shuffled to create a random permutation. Shuffling is used to assure that an aggregate of data elements for a sequence S is randomly arranged, but avoids an ordered or partially ordered permutation. Shuffling is the process of arranging data elements into a random permutation. The sequence S as an aggregation of N data elements, there are N! possible permutations. For the large number of possible permutations, two of the possible permutations are for a sorted or ordered placement of data elements--both an ascending and descending sorted permutation. Shuffling must avoid inadvertently creating either an ascending or descending permutation.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · graph theory and CDMA systems · Cellular Automata and Applications
