Which sorting algorithm is best suited to re-sort an almost fully sorted list?

Question

I have a list of strings which has been sorted by a specific comparison function.

Now I have to re-sort this list using a different comparison function.

Answer 1

Have access to both search operations? If yes, you can to build some hash tree during first sorting process and use it to other sort operations