> But with a index you need two variables, the base pointer + index.
And<br />&gt; unless your compiler + instruction set allows you to addess
a memory <br />&gt; location using a base pointer + index then you are
going to loose much in<br />&gt;  performance. IMHO a pointer is always
faster, it let you write the<br />&gt; algorithm in a different way
avoiding probably the example you gave above.<br /><br />Did you do the
actual performances check ?<br />On decent compiler for non-exotic
architectures the difference is really thin for L1 cache compliant number
of elements. <br /><br />I have nothing against pointer anyway but good
data structure like Numerical Recipes multi-dimensionnal allocation makes
things easier with a very small overhead.