What is mean by stable sorting algorithm?
1
A sorting algorithm is stable if it doesn’t preserve the order of duplicate keys
2
A sorting algorithm is stable if it preserves the order of duplicate keys
3
A sorting algorithm is stable if it preserves the order of all keys
4
A sorting algorithm is stable if it preserves the order of non-duplicate keys