In: Computer Science
Recall the definition of stable sorting:
a sorting algorithm is said to be stable when
elements with equal keys (after the sorting is
complete)
remain in the same order as they were in the input (before the
sorting).
Answer the following: