@josh_cheek I don't think "zero time" generally applies under the umbrella of constant time. Apparently the answer is "K"
-
@josh_cheek@sgrif The only algorithm that could theoretically be < O(1) is one that did literally nothing
@mattlarraz @josh_cheek If you count a literal on the stack as nothing, that is an accurate description of this case, yes
-
-
@sgrif@mattlarraz it's about how amt of work changes as the input grows. O(0), O(1), O(10^6)… they don't change, so they're all equal. -
@sgrif@mattlarraz FWIW, I think it's a mostly useless metric. - 2 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.