On Thu, 05 May 2022 at 21:44, Maxime Devos <maximede...@telenet.be> wrote:
>> 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'. >From a practical point of view, 1. this complexity of O(n log n) is from a magic hat. 2. n and k are the same order of magnitude; say n from 10 to 100 and k from 5 to 50, from my magic hat. 3. this discussion about complexity is totally pointless. Cheers, simon
