Mirel CO┼×ULSCHI, Mihai GABROVEANU, Nicolae CONSTANTINESCU
Usage of advanced data structure for improving efficiency for large (n,m) permutations inspired from the Josephus problem

Abstract. Choosing the right data structure has been proved many times to have a major role toward design of an optimal algorithm. In this paper, we will present two classical algorithms (together with their associated classical data structures, array and linked list) for finding the (n,m)-Josephus permutations, our contribution being materialized in the third algorithm and the usage of an interesting data structure, binary indexed tree, which combines the ideas from binary tree traversal algorithms with the idea of binary representation of an index.

READ THE PDF