The online list labeling problem is a basic primitive in data
structures. The goal is to store a dynamically-changing set of n
items in an array of m slots, while keeping the elements in sorted
order. To do so, some items may need to be moved over...