I'm wondering whether the standard libraries sorting algorithms (e.g. std::sort) are using the heap memory for sorting.
Is there any reliable source how to find out what kind (heap, stack) and how much of temporary memory is used by a sorting algorithm or any standard library algorithm in general?
The background is that I consider to introduce some of the standard library algorithms into an embedded environment in which a controlled memory usage is crucial. (especially the heap shall not be used).
Thank you in advance!