Fast Inverse Square Root — A Quake III Algorithm
Why it was recommended
This video is approachable and explains it pretty well
Recommendationinfogulch · Original
What it covers
A walkthrough of the Quake III fast inverse square root, explaining where the constant 0x5f3759df comes from. It covers IEEE 754 floats, the bit hack that approximates a. It is for someone who already knows the basic terms and wants the next step.
Video details
- Channel
- Nemean
- Length
- 20 min 8 sec
- Year
- 2020
More in this topic
- CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
- The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
- Modern Dictionaries by Raymond Hettinger
- CppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures"
- CppCon 2017: Juan Pedro Bolivar Puente “Postmodern immutable data structures”
- Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019