A New 0(klog n) Algorithm for Josephus Problem

Hikaru Manabe, Ryohei Miyadera, Yuji Sasaki +2

We present a new O(k log n) algorithm of the Josephus problem. The time complexity of our algorithm is O(k log n), and this time complexity is on a par with the existing O(k log n)…