alphacyberranger to Programmer [email protected]English • 3 months agoNot everything can be done in constant time, that's O(k)sh.itjust.worksmessage-square40fedilinkarrow-up1409
arrow-up1409imageNot everything can be done in constant time, that's O(k)sh.itjust.worksalphacyberranger to Programmer [email protected]English • 3 months agomessage-square40fedilink
minus-square@[email protected]linkfedilink2•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-square@[email protected]linkfedilink7•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