Identify the correct definition of Sorting stability.
- A. A search algorithm that checks each element in a list sequentially until the target value is found.
- B. A method of analyzing algorithms that determines the average time or space cost over a sequence of operations.
- C. An algorithm that computes shortest paths from a single source vertex in a graph, even with negative edge weights.
- D. A property of a sorting algorithm where elements with equal keys retain their original relative order. ✓
Correct answer
D. A property of a sorting algorithm where elements with equal keys retain their original relative order.
Explanation
Sorting stability refers to a property of a sorting algorithm where elements with equal keys retain their original relative order.