5 ms·
Yes, so ordinarily we analyse an idealised algorithm running on idealised machine. However if an upper bound is clearly introduced to this idealised setting, as
by carnitine 4y ago
Yes, so ordinarily we analyse an idealised algorithm running on idealised machine. However if an upper bound is clearly introduced to this idealised setting, as in the root comment, then it can’t be ignored.
- waynesonfire 4y agoSo an idealised machine doesn't have an arbitrary INT_MAX limit. The algorithms are O(n).
- l33t2328 4y agoBut playing tricks with the INT_MAX limit ignores(or, more accurately, spits in the face of) the fact that we want our computers to pretend to be idealized machines. Floats aren’t real numbers but we treat them like the mathematical object that they model for most purposes. Of course, being aware of the limits of our models are important, but abusing the tragic finitness of our models to “well actually” someone is generally not helpful.