Speed Up Access to Fractal-Like Array
I think that the fastest approach with modern CPUs is

i = num &amp; 255
j = num &gt;&gt; 8
*x = x1[i] + x2[j]
*y = y1[i] + y2[j]


That is 4 arithmetic ops plus 4 loads