wagi | Write HTTP handlers in WebAssembly with a minimal amount

I decided to sit down a bit and try tackling this problem. If I understand correctly, we are performing swaps on list in order to get them sorted like in the destination list.

There are two types of operations we can do. Swapping two numbers to destination, which is swapping two numbers and they both land where they belong. And swapping one number to destination, which makes one of them land where it belongs and puts other in the incorrect location.

Perfect swap should always be prioritized over one-element to destination. After writing it down on paper, I also concluded that to minimize the sum when doing one-element to desination swaps, the more you move the smallest element, the smaller the sum.

So, the algorithm I came up with is: Find smallest weight element in target, find what should be in its place, switch them. Then remove all elements that are on their correct places from both target and origin lists(in order to find new smallest weight if previous one is already in destination), loop until the lists are empty.

Program will use one-to-destination swaps to move the lowest weight as long as it can, and when its done, chooses next smallest element. two-way perfect swaps will solve themselves when program picks one of those elements as the smallest weight.

I am not sure if this algorithm is perfectly correct, especially on the corner cases, but it's the best I could come up with, with the little time I have.