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 votes142 views1 answer
C++ get files in directory
C++
0 vote139 views1 answer
C++ thread wait fro 1 sec
C++
1 vote141 views1 answer
Print 5 table in c++
C++
-1 vote143 views1 answer
Equal elements in two arrays in c++
C++
11 votes145 views2 answers
C++ int main()
C++
0 vote154 views1 answer
Pop off end of string c++
C++
0 vote143 views1 answer
C++ classes
C++
0 vote150 views1 answer
Transform c++
C++
-1 vote206 views1 answer
How to define range of numbers inside a if condition in c++
C++
4 votes135 views3 answers
Count set bits in an integer c++
C++