Partial sort of std::list

Question

I have a linked list that I want to sort part of, eg:

std::sort(someIterator, otherIterator, predicate);

std::sort requires random-access i

Answer 1

Yes, but you will have to use a merge sort.

Answer 2

How about unhooking the part of the list that you want sorted, into a standalone list, then use the specialized list sort, then hook it back into the original list?