Description
Answer the following questions.
What does it mean for a sorting algorithm to be “stable”? Name a stable and a non-stable sorting algorithm. Explain the key reasons for an algorithm to be stable or not stable.
What does it mean for a sorting algorithm to be “in-place”? Name an in-place and a non-in-place sorting algorithm. Explain the key reasons for an algorithm to be in-place or non-in-place.
