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 votes122 views1 answer
C++ primality test
C++
-1 vote117 views10 answers
Time complexity calculator online
C++
5 votes128 views3 answers
C++ remove space from string
C++
0 vote103 views1 answer
String to hexadecimal in c
C++
0 vote114 views1 answer
Priority queue smallest first
C++
0 vote121 views1 answer
Flake8 max line length
C++
6 votes107 views2 answers
Stack erase
C++
0 vote136 views1 answer
Tabeau dynamique c++
C++
0 vote109 views1 answer
If(arr[i]==k) return arr[i];
C++
0 vote112 views1 answer
How to make an enum in c++
C++