Josephus problem: Difference between revisions

=={{header|R}}==

===Growing circle solution===

y <- 0:(r-1)

for (i in (r+1):n)

*The idiomatic way to roll an array in R (e.g. as [[Josephus_problem#Ruby|the Ruby solution]] has) is to exploit the head and tail functions, but those break if we are rolling by more than the length of the array (see https://stackoverflow.com/q/18791212 for a few tricks for this).

Regardless, it is still solvable. The following adapts a great deal of [[Josephus_problem#Lua|the Lua solution]]. The arguments n, k, and m are as in the task description.

{

prisoners<-0:(n-1)