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.worksexternal-linkmessage-square38fedilinkarrow-up1312arrow-down19
arrow-up1303arrow-down1external-linkNot 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-square38fedilink
minus-squarecatastrophicblues@lemmy.calinkfedilinkarrow-up1·8 months agoSurely you could implement this via a sorting algorithm? If you can prove the distance function is a metric and both lists contains elements from the same space under that metric, isn’t the answer to sort both?
minus-squarejjagaimo@lemmy.calinkfedilinkarrow-up2·8 months agoIt’s essentially the traveling salesman problem
Surely you could implement this via a sorting algorithm? If you can prove the distance function is a metric and both lists contains elements from the same space under that metric, isn’t the answer to sort both?
It’s essentially the traveling salesman problem