Josephus problem: Difference between revisions

Line 3,360:

Not the fastest method, but illustrates use of ancillary stacks, and using nests as queues.

<lang Quackery>[ stack ] is ~~prisoners~~ ( --> s )

<lang Quackery>[ stack ] is survivors ( --> s )

[ stack ] is ~~executioner-actions~~ ( --> s )

[ stack ] is prisoners ( --> s )

[ stack ] is executioner-actions ( --> s )

[ [] swap times [ i^ join ]

prisoners put ] is make-prisoners ( n --> )

[ prisoners take

behead join

prisoners put ] is walk ( --> )

[ prisoners take

behead drop

prisoners put ] is kill ( --> )

[ [] swap 1 - times

[ ' walk nested join ]

' kill nested join

executioner-actions put ] is make-executioner ( n --> )

[ executioner-actions take

behead dup do nested join

executioner-actions put ] is execute-kth ( --> )

[ survivors put

[ make-executioner

make-executioner

make-prisoners

[ execute-kth

prisoners share

size ~~1 = until ]~~

size

survivors share = until ]

survivors release

executioner-actions release

prisoners take 0 ~~peek~~ ] is josephus ( n n --> n )</lang>

prisoners take ] is josephus ( n n n --> n )</lang>

'''Testing in Quackery shell:'''

<pre>/O> 41 3 josephus

<pre>/O> 41 3 1 josephus

... 41 3 3 josephus

...

Stack: 30</pre>

Stack: [ 30 ] [ 15 30 34 ]</pre>

=={{header|R}}==