qaz@lemmy.world to Programmer Humor@programming.devEnglish · 23 days agoWho cares about time complexitylemmy.worldimagemessage-square69linkfedilinkarrow-up1456
arrow-up1456imageWho cares about time complexitylemmy.worldqaz@lemmy.world to Programmer Humor@programming.devEnglish · 23 days agomessage-square69linkfedilink
minus-squareTheLazyNerd@europe.publinkfedilinkEnglisharrow-up19·22 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).