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

0 vote164 views1 answer
Lambda function qt connect
C++
0 vote144 views1 answer
C code to c++ converter
C++
13 votes170 views3 answers
C++ remove last element from vector
C++
0 vote170 views5 answers
Run time calculator c++
C++
0 vote161 views1 answer
The program must enter a natural number n from the console and find the number previous to n that is not divisible by 2 , 3 and 5 .
C++
1 vote162 views1 answer
Perulangan c++
C++
8 votes178 views3 answers
Min in c++
C++
1 vote179 views1 answer
How to specify how many decimal to print out with std::cout
C++
1 vote142 views1 answer
How to run a c++ program in the background
C++
1 vote182 views2 answers
Convert letters to uppercase in c++
C++