Merging sorted sequences

Kestrel Freight needs one timeline from two sorted lists of gate scans, rebuilt every second. Joining and sorting is correct but about four times too slow, because it ignores the order each list already has. Two pointers take the smaller front each step and copy the rest when a list runs out: n plus m steps. The same walk finds shared values and overlapping time slots.