Question: What does it mean for a sorting algorithm to be stable? Select the correct answer: Randomness is not used in the algorithm. Equal elements preserve

What does it mean for a sorting algorithm to be stable? Select the correct answer: Randomness is not used in the algorithm. Equal elements preserve their original order. Only binary comparisons le... less than are used Expected running time is the same on all inputs. I don't know
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
