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

3 votes223 views1 answer
Infinite loop c++
C++
1 vote203 views1 answer
Shared_ptr header file
C++
0 vote215 views6 answers
Iterator on std::tuple
C++
0 vote213 views1 answer
C++ delete int
C++
-1 vote205 views1 answer
String array 2d c++
C++
1 vote199 views1 answer
C++ ::
C++
1 vote203 views1 answer
Get handle in C++
C++
-3 votes230 views1 answer
Array c plus plus
C++
267 votes225 views1 answer
Visual studio c++ compiler
C++
0 vote206 views1 answer
CoinPiles
C++