aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data update

Browse source
This commit is contained in:
Ingy döt Net 2026-04-30 12:34:36 -04:00
parent 4bb20c9b71
commit cbaf4c4b64
12390 changed files with 318560 additions and 27248 deletions
Download patch file Download diff file Expand all files Collapse all files

8
Task/Josephus-problem/Phix/josephus-problem.phix
View file

@ -16,7 +16,7 @@ function skipping(sequence prisoners, integer step, survivors=1)
end function
--?skipping({"Joe","Jack","William","John","James"},2,1) --> {"William"}
-- linked list - used by Arch64 Assembly, Ada, ARM Assembly, Common Lisp[2, probably], Fortran,
-- linked list - used by Arch64 Assembly, Ada, ARM Assembly, Common Lisp[2, probably], Fortran(original),
-- JavaScript[1] (albeit dbl-lnk), Python[3].
-- Method: like skipping, all prisoners stay where they are, but
-- the executioner uses the links to speed things up a bit.
@ -81,9 +81,9 @@ end function
-- always using a loop and remove_all() - while not probihitively expensive, it may check lots of things for -1
-- that the slicing won't.
-- contractalot - used by 11L, Arturo, AutoHotkey, C#, C++, Delphi, Frink, Formulae, Java (both), JavaScript[2],
-- Julia[2], Kotlin, Lua, NanoQuery, Nim, Objeck, Oforth, Processing, Python[1], R[2],
-- Rust, Seed7, Swift, VBScript, Vedit, VisualBasic.NET, XPL0, zkl.
-- contractalot - used by 11L, Arturo, AutoHotkey, C#, C++, Delphi, Frink, Formulae, Fortran(alternative), Java (both),
-- JavaScript[2], Julia[2], Kotlin, Lua, NanoQuery, Nim, Objeck, Oforth, Processing, Python[1],
-- R[2], Rust, Seed7, Swift, VBScript, Vedit, VisualBasic.NET, XPL0, zkl.
-- Method: executioner walks round and round, queue contracts after every kill.
-- Often implemented as execute all prisoners then release last one killed.
function contractalot(integer n, integer k, s)