[GLLUG] Software Library Release

[Bong Munoz]

On 2/12/07, Thomas Hruska <thruska at cubiclesoft.com> wrote:
>
> ... Finding
> an entry requires scanning the linked list linearly, resulting in O(N^2)
> load times (i.e. the bigger the config, the longer it takes to load).
> Consider using a hash instead.
>

A configuration file where a linear search in C becomes significant should
be massive. If grep can go through a 7Mb file in mere seconds an O(N) linear
scan should be efficient enough. Besides, configuration data is usually only
loaded once.

--bong
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.egr.msu.edu/mailman/public/linux-user/attachments/20070212/afed047e/attachment.html