alphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 6 months agoNot everything can be done in constant time, that's O(k)sh.itjust.worksimagemessage-square41fedilinkarrow-up1415arrow-down111
arrow-up1404arrow-down1imageNot everything can be done in constant time, that's O(k)sh.itjust.worksalphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 6 months agomessage-square41fedilink
minus-squareVictor@lemmy.worldlinkfedilinkarrow-up1·6 months agoI guess, yeah, that’ll do it. Although that’d probably be yet one or a few extra factors involving n.
minus-squareMinekPo1 [it/she]@lemmygrad.mllinkfedilinkarrow-up1·6 months agothis would assume that finding the next prime is a linear operation , which is false
Maybe finding the (n!)²th prime?
I guess, yeah, that’ll do it. Although that’d probably be yet one or a few extra factors involving n.
this would assume that finding the next prime is a linear operation , which is false