qaz@lemmy.world to Programmer Humor@programming.devEnglish · 6 days agoWho cares about time complexitylemmy.worldimagemessage-square68linkfedilinkarrow-up1449arrow-down12
arrow-up1447arrow-down1imageWho cares about time complexitylemmy.worldqaz@lemmy.world to Programmer Humor@programming.devEnglish · 6 days agomessage-square68linkfedilink
minus-squareTheLazyNerd@europe.publinkfedilinkEnglisharrow-up19·5 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).