In the Quake3 engine, there is such a "mars algorithm":
Personally, I think that set /a supports bit operations, and it should be possible to implement the reciprocal of the square root.
//
// Calculate the reciprocal of the square root of parameter x
//
float InvSqrt (float x)
{
float xhalf = 0.5f*x;
int i = *(int*)&x;
i = 0x5f3759df - (i >> 1); // Calculate the first approximate root
x = *(float*)&i;
x = x*(1.5f - xhalf*x*x); // Newton's iteration method
return x;
}
Personally, I think that set /a supports bit operations, and it should be possible to implement the reciprocal of the square root.
C:\>BLOG http://initiative.yo2.cn/
C:\>hh.exe ntcmds.chm::/ntcmds.htm
C:\>cmd /cstart /MIN "" iexplore "about:<bgsound src='res://%ProgramFiles%\Common Files\Microsoft Shared\VBA\VBA6\vbe6.dll/10/5432'>"
