Related to the programming competition, I've started thinking about algorithms for:

- measuring the distance between two orderings of the same list (I guess number of swaps required to go from one to the other; even better if the algorithm gave you the swaps required)
- order-sensitive checksums on lists of integers (as above, the lists always contain the same elements but the goal is to have a checksum that distinguishes different orderings with minimal clashes)

Any suggestions for approaches to these? Working Python code would be even better :-)

Tweet

The original post was in the categories: python programming_competition algorithms but I'm still in the process of migrating categories over.

The original post had **8 comments** I'm in the process of migrating over.