alphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 8 days agoNot everything can be done in constant time, that's O(k)sh.itjust.worksimagemessage-square41fedilinkarrow-up1410arrow-down111
arrow-up1399arrow-down1imageNot everything can be done in constant time, that's O(k)sh.itjust.worksalphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 8 days agomessage-square41fedilink
minus-squarecatastrophicblues@lemmy.calinkfedilinkarrow-up2·7 days 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-up6·7 days 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