求最大公约数的计算方法

[slowpoke]

如 :
m = 24
n = 12
求 m 和 n 的最大公约 12

如何用 javascript 写出它的计算方法?

[fokker]

var x;
var y;
x=24;
y=12;
alert(f(x,y));

function f(x,y){
var tmp;
var yu;
var result;
if(x>y){
x=tmp;
x=y;
y=x;
}
tmp=1;
while(tmp<=x){
if(x%tmp==0 && y%tmp==0){
result=tmp;
}
tmp+=1;
}
return result;
}

[saucer]

try

<script language="javascript">
function gcd(a,b)
{
a = Math.abs(Math.ceil(a));
b = Math.abs(Math.ceil(b));

if (a < b)
return gcd(b,a);

var r;
while ( b != 0)
{
r = a % b;
a = b;
b = r;
}

return a;
}

alert(gcd(12,24));
</script>

[jiawei725]

function myinput(m,n)
{
//This holds the final answer
var result=0;
if (m<n)
var min=m;
else
var min=n;
for (var i=1;i<=min;i++)
{
if (((m%i)==0)&&((n%i)==0))
result = i;
}
//if result is equal to 0, that means there is no 公约数
alert(result);
}

[seabell]

<script>
m=24;
n=12;
j=0;
k=m<n?m:n;
for(i=1;i<=k;i++)
{
if((m/i==(m-m%i)/i)&&(n/i==(n-n%i)/i))
j=i;
}
alert(j);
</script>

[seabell]

or
<script>
m=24;
n=12;
j=0;
k=m<n?m:n;
for(i=k;i>=1;i--)
{
if((m/i==(m-m%i)/i)&&(n/i==(n-n%i)/i))
{
j=i;
break;
}
}
alert(j);
</script>

[qiushuiwuhen]

<script>
var m=24,n=36
for(i=Math.min(m,n);i>0;i--)if(m%i==0&&n%i==0)break;
alert(i)
</script>