alphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 6 months agoNot everything can be done in constant time, that's O(k)sh.itjust.worksimagemessage-square28fedilinkarrow-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 · 6 months agomessage-square28fedilink
minus-squaremagic_lobster_party@kbin.runlinkfedilinkarrow-up37·6 months agoYou have two lists of size n. You want to find the permutations of these two lists that minimizes a certain distance function between them.
minus-squarecatastrophicblues@lemmy.calinkfedilinkarrow-up2·6 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·6 months agoIt’s essentially the traveling salesman problem
You have two lists of size n. You want to find the permutations of these two lists that minimizes a certain distance function between them.
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