qaz@lemmy.world to Programmer Humor@programming.devEnglish · 4 days agoWho cares about time complexitylemmy.worldimagemessage-square68fedilinkarrow-up1439arrow-down12
arrow-up1437arrow-down1imageWho cares about time complexitylemmy.worldqaz@lemmy.world to Programmer Humor@programming.devEnglish · 4 days agomessage-square68fedilink
minus-squareTheLazyNerd@europe.publinkfedilinkEnglisharrow-up19·3 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).