alphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 3 months agoNot everything can be done in constant time, that's O(k)sh.itjust.worksimagemessage-square27fedilinkarrow-up1412arrow-down111
arrow-up1401arrow-down1imageNot everything can be done in constant time, that's O(k)sh.itjust.worksalphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 3 months agomessage-square27fedilink
minus-squarecatastrophicblueslinkfedilinkarrow-up2·3 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-squarejjagaimolinkfedilinkarrow-up7·3 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