I program now search algorithms which will require the fastest way to access to each item.
E.g. the best way would be to have a
char *[]x;
to access the Nth item I would simply do x[N-1].
Unfortunately items cannot be accessed this simple way.
My question: what is the best (fastest) way to access the Nth item of this pre-determined List.
Thanks
-- For information on using the Palm Developer Forums, or to unsubscribe, please see http://www.palmos.com/dev/support/forums/
