A Recursive Algorithmic Approach to the Finding of Permutations for the Combination of Any Two Sets


In this paper I present a conjecture for a recursive algorithm that finds each permutation of combining two sets of objects (AKA the Shuffle Product). This algorithm provides an efficient way to navigate this problem, as each atomic operation yields a permutation of the union. The permutations of the union of the two sets are represented as binary integers… (More)

3 Figures and Tables


  • Presentations referencing similar topics