The fast inverse square root is based on the fact that the integer representation of a floating point number is a rough approximation of its logarithm.
So convert floating point to its integer representation. So now you have its approximate logarithm. Now take half of that and improve that with some Newton raphson.
The fast inverse square root is based on the fact that the integer representation of a floating point number is a rough approximation of its logarithm.
So convert floating point to its integer representation. So now you have its approximate logarithm. Now take half of that and improve that with some Newton raphson.