alphacyberranger to Programmer Humor@programming.devEnglish · 7 months agoNot everything can be done in constant time, that's O(k)imagemessage-square28fedilinkarrow-up1411arrow-down111
arrow-up1400arrow-down1imageNot everything can be done in constant time, that's O(k)alphacyberranger to Programmer Humor@programming.devEnglish · 7 months agomessage-square28fedilink
minus-squarecatastrophicblues@lemmy.calinkfedilinkarrow-up2·7 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-up7·7 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