A sorting technique is called stable if
1
It takes O (n log n) time
2
it maintains the relative order of occurence of non-distinct elements
3
it uses divide and conquer paradigm
4
it takes O(n) space
A sorting technique is called stable if
It takes O (n log n) time
it maintains the relative order of occurence of non-distinct elements
it uses divide and conquer paradigm
it takes O(n) space