qaz@lemmy.world to Programmer Humor@programming.devEnglish · 1 month agoWho cares about time complexitylemmy.worldimagemessage-square53fedilinkarrow-up1424arrow-down12
arrow-up1422arrow-down1imageWho cares about time complexitylemmy.worldqaz@lemmy.world to Programmer Humor@programming.devEnglish · 1 month agomessage-square53fedilink
minus-squareTheLazyNerd@europe.publinkfedilinkEnglisharrow-up18·1 month 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).