Op 17 sep. 2013 23:38 schreef "David Lang" <[email protected]> het volgende: > > One other thing that Sysadmins need to understand is big O notation > > and also the fact that sometimes a O(N^2) algorithm may be preferred to a O(logN) algorithm if N is small and the fixes overhead of the 'more efficient' algorithm is higher than for the dumb one.
Seems to me that this would be great subjects for some articles/blog entries. ;-) Especially if one could explain such subjects from an sysadmin background. Mvg, Guus
_______________________________________________ Discuss mailing list [email protected] https://lists.lopsa.org/cgi-bin/mailman/listinfo/discuss This list provided by the League of Professional System Administrators http://lopsa.org/
