worse thing is that they are static sized tables and i do not know how achive flexibility in such static array approach,
soft code array size in data file.
read in array size from data file at program start. then malloc entire array at once at program start, and free at program end. set array size big enough to get the job done.
the speed of static arrays, and the variable size of malloc'd arrays.
But what with large c projects (such like windows/linux/gcc)
Are they internally static array based, what is their main containers for data? As I said if this is static arrays it is prone to overflows (mallocked to), static arrays with realloc? If this is something like linked list of structures it would be much slower...