A sorting algorithm is stable if
A. its time complexity is constant irrespective of the nature of input.
B. preserves the original order of records with equal keys.
C. its space complexity is constant irrespective of the nature of input.
D. it sorts any volume of data in a constant time.
Answer:B
A sorting algorithm is stable if
A. its time complexity is constant irrespective of the nature of input. B. preserves the original order of records with equal keys. C. its space complexity is constant irrespective of the nature of input. D. it sorts any volume of data in a constant time.