I'm wondering if fast implementation of pow(), for example this one, is a faster way to get square root of an integer than fast sqrt(x). We know that
sqrt(x) = pow(x, 0.5f)
I cannot test speed myself because I did not find fast implementation of sqrt. My question is: Is fast implementation of pow(x, 0.5f) faster than fast sqrt(x) ?
Edit: I meant powf - pow that takes floats intead of doubles. (doubles are more misleading)