When I look at the sequence and list documentation, I don’t see any method for inserting an element into a list assuming the list is already sorted (which should have linear complexity), or given two sorted lists (e.g, one of length 1 and one of length n) and merging the two lists (which again should have linear complexity). Am I missing something?

Of course I can implement such a function for myself, but if one already exists in the standard library, I’d rather not re-invent the wheel.