Revision as of 04:02, 11 December 2015 edit Rcgldr (talk \| contribs) Extended confirmed users 2,505 edits removed my response, since Stephen has a better response. Added a comment to Stephen's response. ← Previous edit		Revision as of 04:45, 11 December 2015 edit undo Rcgldr (talk \| contribs) Extended confirmed users 2,505 edits →standard template library stable_sort() is not always in place merge sort Next edit →
Line 442: Any algorithm that meets the complexity and stability requirements of ISO C++ can be used but most STLs use a hybrid adaptive mergesort. [[User:Stephen Howe\|Stephen Howe]] ([[User talk:Stephen Howe\|talk]]) 22:02, 28 January 2012 (UTC) :For VS2005, the temporary buffer is 0.5 the size of all the elements. I don't have VS2003 or VS2008. As noted VS 2010 does the same thing, and so does VS2015. The key line is the same for VS2005, VS2010, and VS2015: _Temp_iterator<_Ty> _Tempbuf((_Count + 1) / 2); . Since it was mentioned, stable_partition() does allocate a full size temporary buffer. [[User:Rcgldr\|Rcgldr]] ([[User talk:Rcgldr\|talk]]) 04:0245, 11 December 2015 (UTC) == Implementation code improvements for all sort algorithms ==

Talk:Sorting algorithm: Difference between revisions