qaz@lemmy.world to Programmer HumorEnglish · 4 months agoWho cares about time complexitylemmy.worldimagemessage-square69linkfedilinkarrow-up1458arrow-down12
arrow-up1456arrow-down1imageWho cares about time complexitylemmy.worldqaz@lemmy.world to Programmer HumorEnglish · 4 months agomessage-square69linkfedilink
minus-squareTheLazyNerd@europe.publinkfedilinkEnglisharrow-up19·4 months 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).