Is the computational complexity of `42` (as in some literal) considered to be O(1) or O(0)?
-
-
@sgrif I wouldn't. k sounds like it could be the input, which would be linear like O(n) I've only ever seen O(1) eg https://en.wikipedia.org/wiki/Time_complexity#Table_of_common_time_complexities … -
@josh_cheek@sgrif The only algorithm that could theoretically be < O(1) is one that did literally nothing - 5 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.