Hi hilmar,

>>When having lot's of keys (records) in the index seeking an indexvalue can get slow. Reindexing the file should get a new balance where all values are equally spread in the B-Tree. Theorecticly SEEKing a value in a table of N records would require at most 1+ INT(LOG(N)/LOG(2)) steps.
>
>Theoretically, that is, if the index is completely balanced.
>
>I guess you could simplify the expression above (in VFP) to ceiling(log(N) / log(2)).

Hmmm, are we running some sort of contest of getting the shortest code again :) ?

Walter,