ROT13(g(2307534882734083072Y,1,0).pbz)

[thor]

private static void t(long a, int b, int c)
{
if ((a & 1) > 0)
{
System.out.print((char)('`' + c));
b = (((a >>=1) & 1) > 0) ? -b : b;
}
else if (a == 0) return;

t(a >> 1 , b, c + b );
}

 

[Daniel Pitts]

private static void t(long a, int b, int c)
{
if ((a & 1) > 0)
{
System.out.print((char)('`' + c));
b = (((a >>=1) & 1) > 0) ? -b : b;
}
else if (a == 0) return;

t(a >> 1 , b, c + b );
}

And the point of that little exercise? BTW, tail recursion can be
replaced by a loop.

 

[Sébastien de Mapias]

And the point of that little exercise?
JarPit.

 

[Daniel Pitts]

JarPit.

Yes, thats the same result I got, but I wanted to know the "point" of
it? As far as challenges go, it was lame. As far as advertisements go,
it was lame. As far as sites go ...