qaz@lemmy.world to Programmer Humor@programming.devEnglish · 27 days agoWho cares about time complexitylemmy.worldimagemessage-square54fedilinkarrow-up1436arrow-down12
arrow-up1434arrow-down1imageWho cares about time complexitylemmy.worldqaz@lemmy.world to Programmer Humor@programming.devEnglish · 27 days agomessage-square54fedilink
minus-squareTheLazyNerd@europe.publinkfedilinkEnglisharrow-up18·27 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).