alphacyberranger@sh.itjust.works to Programmer Humor@lemmy.mlEnglish · 6 months agoNot everything can be done in constant time, that's O(k)sh.itjust.worksexternal-linkmessage-square2fedilinkarrow-up15arrow-down10
arrow-up15arrow-down1external-linkNot everything can be done in constant time, that's O(k)sh.itjust.worksalphacyberranger@sh.itjust.works to Programmer Humor@lemmy.mlEnglish · 6 months agomessage-square2fedilink
minus-squareremi_pan@sh.itjust.workslinkfedilinkarrow-up2·6 months agoI know I shouldn’t do it here, but let me ask a serious question : does the square in O(n!²) really matter ? I have a confused intuition that the factorial grows so much faster than the square that it kind of disapears assymptoticaly.
I know I shouldn’t do it here, but let me ask a serious question : does the square in O(n!²) really matter ? I have a confused intuition that the factorial grows so much faster than the square that it kind of disapears assymptoticaly.