alphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 8 months agoNot everything can be done in constant time, that's O(k)sh.itjust.worksimagemessage-square35fedilinkarrow-up1401arrow-down111
arrow-up1390arrow-down1imageNot everything can be done in constant time, that's O(k)sh.itjust.worksalphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 8 months agomessage-square35fedilink
minus-squareuis@lemm.eelinkfedilinkarrow-up1·8 months agoBasically you can say that time it takes never goes above grapf of some function scaled by constant. Fun side effect of this is that you can call your O(1) algorithm is O(n!) algorithm and be technically correct.
Basically you can say that time it takes never goes above grapf of some function scaled by constant.
Fun side effect of this is that you can call your O(1) algorithm is O(n!) algorithm and be technically correct.