Hi,
Just wondering that, is there a version of std::sort in the STL that has memory (assuming std::sort doesn't)? The elements that I want to sort have relatively expensive operator<. Or do I have to make it myself? (eg, assign some kind of heuristic values to elements prior to calling std::sort, and sort base on that heuristic value instead)
Thanks