3 ms·
If you want to measure growth based on another variable you are allowed to do so, but for most algorithms I'm more interested in the growth of time according to
by veltas 4mo ago
If you want to measure growth based on another variable you are allowed to do so, but for most algorithms I'm more interested in the growth of time according to input size.
- recursive 3mo agoThen we may conclude that you may not be interested in this.
- veltas 3mo agoWhat do you mean by this? I was interested in article and parent, that's why I responded.
- recursive 3mo agoYou said "really it's worse than exponential". But that's based on your own personally-interesting way of measuring n, which is inconsistent with the given way.
- veltas 3mo agoHere is the conventional use of Big O notation where the input is a number: https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test#Complexity https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality... As you'll see they are using the number of digits, not the value of the number, because the number of digits is the size of the input. You can find countless examples of this in literature. So this is not a 'personally-interesting' way as you assert.