alphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 5 months agoNot everything can be done in constant time, that's O(k)sh.itjust.worksimagemessage-square41fedilinkarrow-up1414arrow-down111
arrow-up1403arrow-down1imageNot everything can be done in constant time, that's O(k)sh.itjust.worksalphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 5 months agomessage-square41fedilink
minus-squareMinekPo1 [She/Her]@lemmygrad.mllinkfedilinkarrow-up1·edit-25 months agoactually all of my effort was wasted since calculating the hamming distance between two lists of n hashes has a complexity of O(n) not O(1) agh I realized this right after walking away from my devices from this to eat something :( edit : you can calculate the hamming distance one element at a time just after rehashing that element so nevermind
actually all of my effort was wasted since calculating the hamming distance between two lists of n hashes has a complexity of O(n) not O(1) agh
I realized this right after walking away from my devices from this to eat something :(
edit : you can calculate the hamming distance one element at a time just after rehashing that element so nevermind