RosettaCodeData/Task/Hailstone-sequence/Ursa/hailstone-sequence.ursa

16 lines
225 B
Text
Raw Permalink Normal View History

2023-07-01 11:58:00 -04:00
import "math"
def hailstone (int n)
decl int<> seq
while (> n 1)
append n seq
if (= (mod n 2) 0)
set n (floor (/ n 2))
else
set n (int (+ (* 3 n) 1))
end if
end while
append n seq
return seq
end hailstone