How big is the performance gap between std::sort and std::stable_sort in practice?

Question

Both should run in O(n log n), but in general sort is faster than stable_sort. How big is the performance gap in practice? Do you have some experience about that?

I want

Answer 1

Big enough to warrant a separate function that does stable sort and not have std::sort() do it transparently.