Fast Inverse Square Root

Fast inverse square root explained

    float InvSqrt(float x){
        float xhalf = 0.5f * x;
        int i = *(int*)&x;            // store floating-point bits in integer
        i = 0x5f3759df - (i >> 1);    // initial guess for Newton's method
        x = *(float*)&i;              // convert new bits into float
        x = x*(1.5f - xhalf*x*x);     // One round of Newton's method
        return x;
    }

Source: betterexplained.com

Fast Inverse Square Root

float Q_rsqrt( float number )
{
	long i;
	float x2, y;
	const float threehalfs = 1.5F;

	x2 = number * 0.5F;
	y  = number;
	i  = * ( long * ) &y;                       // evil floating point bit level hacking
	i  = 0x5f3759df - ( i >> 1 );               // what the fuck? 
	y  = * ( float * ) &i;
	y  = y * ( threehalfs - ( x2 * y * y ) );   // 1st iteration
//	y  = y * ( threehalfs - ( x2 * y * y ) );   // 2nd iteration, this can be removed

	return y;
}

Source: en.wikipedia.org

Similar codes

2 votes175 views1 answer
Allocation an array with new cpp
C++
0 vote192 views1 answer
Delay millis arduino
C++
0 vote227 views2 answers
Iostream c++
C++
0 vote196 views1 answer
MPI_Sendrecv
C++
25 votes232 views10 answers
Translate
C++
-1 vote193 views1 answer
How to print items in arduino
C++
3 votes183 views1 answer
Library imported for stl
C++
-1 vote176 views1 answer
Execute executable in c++
C++
0 vote220 views1 answer
Rotation 2d d'un point
C++
5 votes343 views6 answers
Ngrok http
C++