qaz@lemmy.world to Programmer Humor@programming.devEnglish · 1 month agoWho cares about time complexitylemmy.worldimagemessage-square61linkfedilinkarrow-up1433arrow-down12
arrow-up1431arrow-down1imageWho cares about time complexitylemmy.worldqaz@lemmy.world to Programmer Humor@programming.devEnglish · 1 month agomessage-square61linkfedilink
minus-squareTheLazyNerd@europe.publinkfedilinkEnglisharrow-up16·1 month 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).