Take the 2-minute tour ×  Is it possible to make a reciprocal of
float division in form of look up table (such like 1/f ->
1*inv[f] ) ? How it could be done? I think some and mask and
shift should be appled to float to make it a form of index? How
would be it exectly?  share|improve this question Are you
looking for hackery like this? –  user529758 Sep 1 '12 at 10:55
Do you realize that this either loses a lot of accuracy, or
results in a friggin' huge lookup table? There are a lot of
floats, even if you restrict yourself to a range like [0.0,
1.0). –  delnan Sep 1 '12 at 10:58 @up I need only reciprocal -
say 10 bits of accuracy (1024 floats in look_up table) - I
wander if it would be faster or slower –  grunge fightr Sep 1
'12 at 11:04 @H2CO3 no, I need it for division not for inverted
square root –  grunge fightr Sep 1 '12 at 11:07 @grungefightr
(facepalm truncated) I know, I meant do you want to implement
fast division using bit-level manipulation or you specifically
want to use lookup tables? –  user5297