Hi all, thanks for your quick responses on the subject. What i am looking for is a procedural algorithm that has to provide a fast solution.The well known constraints are small memory footprint and lack of computing power is really a concern, but most of all is that the array is bigger and bigger over time, because it is and array constructed from a database query through a C API interface. The bottleneck in the final application is this point, where the algorithm searches the array to find the empty slots and then fill those slots with data. Is there really sth that can 'dissapear' that bottleneck? Do u have any suggestions??
Best regards, Chris. - To unsubscribe from this list: send the line "unsubscribe linux-c-programming" in the body of a message to [EMAIL PROTECTED] More majordomo info at http://vger.kernel.org/majordomo-info.html
