libretro/scummvm
1
0
Fork 0
mirror of https://github.com/libretro/scummvm.git synced 2025-01-19 16:33:50 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

JANITORIAL: Some small explanation about stability of sorting algorithms.

Browse Source 
Special thanks to lskovlun for his suggestion to add this.

svn-id: r51524
This commit is contained in:
Johannes Schickel 2010-07-30 23:42:50 +00:00
parent fd0f5696a5
commit f75d84cbdd
1 changed files with 13 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
common/algorithm.h
View File

@ -199,8 +199,19 @@ T sortPartition(T first, T last, T pivot, StrictWeakOrdering &comp) {
* It compares data with the given comparator object comp.
*
* Like std::sort this is not guaranteed to be stable.
* Actually as the time of writing our implementation
* is unstable.
*
* Two small quotes from wikipedia about stability:
*
* Stable sorting algorithms maintain the relative order of records with
* equal keys.
*
* Unstable sorting algorithms may change the relative order of records with
* equal keys, but stable sorting algorithms never do so.
*
* For more information on that topic check out:
* http://en.wikipedia.org/wiki/Sorting_algorithm#Stability
*
* NOTE: Actually as the time of writing our implementation is unstable.
*/
template<typename T, class StrictWeakOrdering>
void sort(T first, T last, StrictWeakOrdering comp) {