Fast inverse square root

-=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- (c) WidthPadding Industries 1987 0\|679\|0 -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=- -=+=-
SoCoder -> Snippet Home -> Variables

Phoenix	Created : 29 June 2009 Language : Monkey Fast inverse square root
Found this while browsing about the net, and I thought it could be useful (or at least an interesting read). Lengthy explanation, for the mathematically inclined. float InvSqrt(float x){ float xhalf = 0.5f * x; int i = (int)&x; // store floating-point bits in integer i = 0x5f3759d5 - (i >> 1); // initial guess for Newton's method x = (float)&i; // convert new bits into float x = x(1.5f - xhalfx*x); // One round of Newton's method return x; } --v

Comments
Monday, 29 June 2009, 16:19
Scherererer	This is really interesting; I skimmed through the research paper, probably give it a closer look a bit later. I've covered Newton's method in the recent pass; probably one of the most important computational approximation methods in existence, but it was very interesting reading how they derived that constant. I'll need to remember this function so I can use it later projects. Thanks!