qaz@lemmy.world to Programmer Humor@programming.devEnglish · 9 days agoWho cares about time complexitylemmy.worldimagemessage-square67fedilinkarrow-up1448
arrow-up1448imageWho cares about time complexitylemmy.worldqaz@lemmy.world to Programmer Humor@programming.devEnglish · 9 days agomessage-square67fedilink
minus-squareTheLazyNerd@europe.publinkfedilinkEnglisharrow-up19·8 days agoSince Roman numerals have an upper bound, the time complexity is always O(1).
Since Roman numerals have an upper bound, the time complexity is always O(1).