16 Mar
2009
16 Mar
'09
9:25 p.m.
yes, but O(n) n times is O(n^2) On Mon, Mar 16, 2009 at 4:22 PM, Paul Baxter <pauljbaxter@hotmail.com> wrote:
Object pool is very slow. destroy() is O(n) where n is the number of free objects. Therefore if you allocate N objects and then destroy N objects, you end up with a O(N^2) runtime. < I know nothing about the classes in question, but an O(n) followed by (plus) another O(n) operation is still O(n) NOT O(n^2)
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost