qaz@lemmy.world to Programmer Humor@programming.devEnglish · 2 months agoWho cares about time complexityimagemessage-square69linkfedilinkarrow-up1457arrow-down12
arrow-up1455arrow-down1imageWho cares about time complexityqaz@lemmy.world to Programmer Humor@programming.devEnglish · 2 months agomessage-square69linkfedilink
minus-squareTheLazyNerdlinkfedilinkEnglisharrow-up19·2 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).