qaz@lemmy.world to Programmer Humor@programming.devEnglish · 29 days agoWho cares about time complexityimagemessage-square69linkfedilinkarrow-up1456arrow-down12
arrow-up1454arrow-down1imageWho cares about time complexityqaz@lemmy.world to Programmer Humor@programming.devEnglish · 29 days agomessage-square69linkfedilink
minus-squareTheLazyNerdlinkfedilinkEnglisharrow-up19·28 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).