Yes, sure, that's clear to me.

The point is - 

1. How to determine that threshold - the n such that f(n) > g(n), knowing that g(n) is (n^2 * k + C) with k and C mostly unknown? [the actual definition is probably different, but there ARE a C and a k in addition to a simple n vs. n^2]

2. Will it EVER be reached?

Creating a test case with a lot of sprites and benchmarking; nothing happens - that's because the maximum value of "a lot of sprites" that can be obtained by clicking "add sprite" like crazy in the editor is in the order of TENS, so very low for our purpouses.

The most rects I ever ACTUALLY saw is when a lot of text is displayed - e.g. balloons in Rosemary, since every letter is a rect - and it's not nearly enough to get there.

So, my conclusion is:

a. I can't seem to determine where the threshold is (at least not via benchmarking/profiling)
b. I really think it's very, very far ahead and it will never be reached under realistic conditions (which sort of implies a)

So, I just ignore it, at least for the time being. 

If you can offer any insight about a. or b. or suggest a way to determine that point please, please do tell.