The concept in which a property of a sorting algorithm where elements with equal keys retain their original relative order is best known as which of these terms?
- A. Bellman-Ford algorithm
- B. Amortized analysis
- C. Sorting stability ✓
- D. Linear search
Correct answer
C. Sorting stability
Explanation
Sorting stability refers to a property of a sorting algorithm where elements with equal keys retain their original relative order.