Liliana Marie Prikler schreef op do 05-05-2022 om 21:08 [+0200]:
> > And the O(n)=O(1) doesn't seem quite right here to me -- individual
> > profiles will be smaller and hence faster, but there will also be
> > _more_ profiles.  Maybe if you sum over the profiles, you'll get to
> > O(n) instead of O(n²) (where n = number of store items in the
> > profiles)
> Again, k(n log n) <= nk log nk, for k >= 1.

Logarithms are mostly neglible though in practice?
And

  kn log nk = kn log n + kn log k ≅ kn log n

for small 'log k'.

Greetings
Maxime.