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