qaz@lemmy.world to Programmer Humor@programming.devEnglish · 22 days agoWho cares about time complexitylemmy.worldimagemessage-square69fedilinkarrow-up1455arrow-down12
arrow-up1453arrow-down1imageWho cares about time complexitylemmy.worldqaz@lemmy.world to Programmer Humor@programming.devEnglish · 22 days agomessage-square69fedilink
minus-squareTheLazyNerd@europe.publinkfedilinkEnglisharrow-up19·22 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).