Digital-Logic-Design
October 26, 2023Multiplexer
October 26, 2023Sorting
| Question 2 |
A sorting technique is called stable if
| it takes O (nlog n) time | |
| it maintains the relative order of occurrence of non-distinct elements | |
| it uses divide and conquer paradigm | |
| it takes O(n) space |
Question 2 Explanation:
Sorting techniques are said to be stable if it maintains the relative order of occurrence of non-distinct element.
Correct Answer: B
Question 2 Explanation:
Sorting techniques are said to be stable if it maintains the relative order of occurrence of non-distinct element.
Subscribe
Login
0 Comments