
Fast inverse square root
Root-finding algorithm

Root-finding algorithm
Fast inverse square root, sometimes referred to as Fast InvSqrt() or by the hexadecimal constant 0x5F3759DF, is an algorithm that estimates 1 / x {\textstyle 1/{\sqrt {x}}} , the reciprocal (or multiplicative inverse) of the square root of a 32-bit floating-point number x {\displaystyle x} in IEEE 754 floating-point format. The algorithm is best known for its implementation in the 1999 video game Quake III Arena. With subsequent hardware advancements, especially the x86 SSE instruction rsqrtss, this algorithm is not generally the best choice for modern computers, though it remains an interesting historical example. The algorithm accepts a 32-bit floating-point number as the input and stores a halved value for later use. Then, treating the bits representing the floating-point number as a 32-bit integer, a logical shift right...
Read on Wikipedia · Image GPL
Open boosters, collect cards and trade them. Free to play.
Play for free