17.1.3. Stability in Merge Sort

Try these first

1. 1.

   What is a stable sort?

   Hint

   Think about sorting where two identical scores are at stake.

2. 2.

   Name one stable sorting algorithm.

   Hint

   Recall an algorithm that divides and conquers.

3. 3.

   What defines a stable sorting algorithm?

   • A. It sorts data quickly.
   • B. It preserves original order of equal elements.
   • C. It uses more memory.

   Hint

   Think about what happens to identical items after sorting.

4. 4.

   Is merge sort always stable?

   • True
   • False

   Hint

   Reflect on how merge sort handles equal elements.

5. 5.

   Consider a dataset of students' names and scores. You first sorted it alphabetically by name, and then by score. If you notice that some students have the same scores, explain how to implement a stable sort to maintain original alphabetical order.

   Hint

   Think back to how merge operations handle ties.

6. 6.

   Discuss how the context of data storage affects your choice of sorting algorithms. What criteria should you consider when sorting large datasets that's stored across multiple locations?

   Hint

   Reflect on the properties of the algorithms we've studied.