Jump to content

Greatest common divisor: Difference between revisions

m
Added Raven code for Greatest common divisor
m (Added Raven code for Greatest common divisor)
Line 1,934:
</lang>
 
=={{header|Raven}}==
===Recursive Euclidean algorithm===
<lang Raven>define gcd use $u, $v
$v 0 > if
$u $v % $v gcd
else
$u abs
 
24140 40902 gcd</lang>
{{out}}<pre>34</pre>
=={{header|REBOL}}==
<lang rebol>gcd: func [
118

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.