An O(n log m) algorithm for the Josephus Problem

DOI10.1016/0196-6774(83)90025-1zbMath0521.68033OpenAlexW2014866140MaRDI QIDQ3670552

Errol L. Lloyd

Publication date: 1983

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(83)90025-1

zbMATH Keywords

permutation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05)

Related Items

Functional iteration and the Josephus problem ⋮ An application of Fourier transforms on finite abelian groups to an enumeration arising from the Josephus problem ⋮ The feline Josephus problem ⋮ General solution to the spectator-first Tantalizer problem

This page was built for publication: An O(n log m) algorithm for the Josephus Problem