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-square5fedilinkarrow-up14arrow-down10
arrow-up14arrow-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-square5fedilink
minus-squaremagic_lobster_party@kbin.runlinkfedilinkarrow-up3·3 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.
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.