Not everything can be done in constant time, that's O(k)
magic_lobster_party @ magic_lobster_party @kbin.run Posts 1Comments 624Joined 1 yr. ago
magic_lobster_party @ magic_lobster_party @kbin.run
Posts
1
Comments
624
Joined
1 yr. ago
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.