Like std::sort(), stable_sort also sorts an array. The syntax is also same.

`// C++ program to demonstrate default behaviour of ` `// sort() in STL. ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `int` `main() ` `{ ` ` ` `int` `arr[] = { 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 }; ` ` ` `int` `n = ` `sizeof` `(arr) / ` `sizeof` `(arr[0]); ` ` ` ` ` `stable_sort(arr, arr + n); ` ` ` ` ` `cout << ` ```
"
Array after sorting using "
``` ` ` ```
"default sort is :
"
``` `; ` ` ` `for` `(` `int` `i = 0; i < n; ++i) ` ` ` `cout << arr[i] << ` `" "` `; ` ` ` ` ` `return` `0; ` `} ` |

Output :

Array after sorting using default sort is : 0 1 2 3 4 5 6 7 8 9

So by default, sort() sorts an array in ascending order.

**How to sort in descending order?**

Like sort(), stable_sort() takes a third parameter that is used to specify the order in which elements are to be sorted. We can pass “greater()” function to sort in increasing order. This function does comparison in a way that puts greater element before.

`// C++ program to demonstrate descending order ` `// stable sort using greater<>(). ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `int` `main() ` `{ ` ` ` `int` `arr[] = { 1, 5, 8, 9, 6, 7, 3, 4, 2, 0 }; ` ` ` `int` `n = ` `sizeof` `(arr) / ` `sizeof` `(arr[0]); ` ` ` ` ` `stable_sort(arr, arr + n, greater<` `int` `>()); ` ` ` ` ` `cout << ` ```
"Array after sorting :
"
``` `; ` ` ` `for` `(` `int` `i = 0; i < n; ++i) ` ` ` `cout << arr[i] << ` `" "` `; ` ` ` ` ` `return` `0; ` `} ` |

Output:

br>Array after sorting : 9 8 7 6 5 4 3 2 1 0

**When to prefer stable_sort over sort()?**

Sometime we want to make sure that order of equal elements is same in sorted array as it was in original array. This can be useful if these values have associated other fields. For example, consider sorting students by marks, if two students have same marks, we may want to keep them in same order as they appear input. Please refer stability in sorting algorithms for details.

Consider following example. We have time intervals sorted by ending time and we want to sort by start time. Also, if two start times are same, we want to keep them sorted by end time. This is not guaranteed by sort().

`// A C++ program to demonstrate STL stable_sort() ` `// to sort intervals according to start time. ` `// Given intervals are sorted according to ` `// ending time ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// An interval has start time and end time ` `struct` `Interval { ` ` ` `int` `start, end; ` `}; ` ` ` `// Compares two intervals according to staring ` `// times. ` `bool` `compareInterval(Interval i1, Interval i2) ` `{ ` ` ` `return` `(i1.start < i2.start); ` `} ` ` ` `int` `main() ` `{ ` ` ` `// Given intervals are sorted according to end time ` ` ` `Interval arr[] = { {1, 3}, {2, 4}, {1, 7}, {2, 19} }; ` ` ` `int` `n = ` `sizeof` `(arr) / ` `sizeof` `(arr[0]); ` ` ` ` ` `// sort the intervals in increasing order of ` ` ` `// start time such that the start time intervals ` ` ` `// appear in same order as in input. ` ` ` `stable_sort(arr, arr + n, compareInterval); ` ` ` ` ` `cout << ` ```
"Intervals sorted by start time :
"
``` `; ` ` ` `for` `(` `int` `i = 0; i < n; i++) ` ` ` `cout << ` `"["` `<< arr[i].start << ` `", "` `<< arr[i].end ` ` ` `<< ` `"] "` `; ` ` ` ` ` `return` `0; ` `} ` |

Output:

Intervals sorted by start time : [1, 3] [1, 7] [2, 4] [2, 19]

**Implementation**

sort() function usually uses Introsort. Therefore, sort() may preserve the physical order of semantically equivalent values but can’t be guaranteed.

stable_sort() function usually uses mergesort. Therefore, stable_sort() preserve the physical order of semantically equivalent values and its guaranteed.

**Time Complexity**

For sort() it is O(n*log(n))

For stable_sort() it is O(n*log^2(n)) if additional memory linearly proportional to length is not available. If its available then O(n*log(n)).

## leave a comment

## 0 Comments