alphacyberranger@sh.itjust.works to Programmer Humor@lemmy.mlEnglish · 5 months agoNot everything can be done in constant time, that's O(k)sh.itjust.worksimagemessage-square1fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1imageNot everything can be done in constant time, that's O(k)sh.itjust.worksalphacyberranger@sh.itjust.works to Programmer Humor@lemmy.mlEnglish · 5 months agomessage-square1fedilink
minus-squareremi_pan@sh.itjust.workslinkfedilinkarrow-up1·4 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.