5 ms·
Dijkstra's algorithm is close enough to the Bellman equation for programmers, I guess :) Also I don't really think taking a Taylor series for the inverse squar
by ArbitraryLimits 13y ago
Dijkstra's algorithm is close enough to the Bellman equation for programmers, I guess :)
Also I don't really think taking a Taylor series for the inverse square root should count as an "algorithm."
- nly 13y agoI think the reason the inverse square root function got so much coverage was because of the bithacking of the float format, and the apparent WTFyness of the code. Also didn't it use Newtons method, not a Taylor series expansion? My math at that level is stale.
- NAFV_P 13y ago> ... and the apparent WTFyness of the code. That's what ID Software thought: http://en.wikipedia.org/wiki/Fast_inverse_square_root#Overview_of_the_code http://en.wikipedia.org/wiki/Fast_inverse_square_root#Overvi...
- sp332 13y agoIt did use Newton's method, and the cool part was that with a carefully-chosen initial value, you only had to run 1 iteration to get a reasonably good result.
- ArbitraryLimits 13y agoYou're right, it was Newton's method.