 Interleaving distance

Interleaving distance is a metric used to measure the similarity between two sequences, particularly in the context of data structures and algorithms, such as in sorting and merging algorithms. It quantifies how "close" two sequences (or permutations) are to being interleaved versions of each other.