Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Algorithm Design Techniques Divide and Conquer
A sorting technique is called stable if
1
If it takes O(n log n) time
2
It uses divide and conquer technique
3
Relative order of occurrence of non-distinct elements is maintained
4
It takes O(n) space