63 816
Assignments Done
99,5%
Successfully Done
In August 2018

Answer to Question #52161 in Other Programming & Computer Science for irebami

Question #52161
Which of the following sorting algorithms maintain the relative order of records with equal keys?

Quicksort
Stable
Mergesort
Unstable
Expert's answer
b.Stable
Stability: stable sorting algorithms maintain the relativeorder of records with equal keys (i.e. values). That is, a sorting algorithm is stable if whenever there are two records R and S with the same key and with R appearing before S in the original list, R will appear before S in the sorted list.

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be first!

Leave a comment

Ask Your question

Submit
Privacy policy Terms and Conditions