Question: Which of these properties makes a sorting algorithm stable? ( 1 Point ) It has a time complexity of O ( nlogn ) . It
Which of these properties makes a sorting algorithm stable? PointIt has a time complexity of OnlognIt maintains the relative order of equal elements in the input.It does not require additional memory.It is recursive.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
