17.1.5. Cost of Movements in Sorting

Try these first

1. 1.

   What is stable sorting?

   Hint

   Think about how sorting multiple attributes works.

2. 2.

   Name a sorting algorithm that is not stable.

   Hint

   Consider the methods involved in quick sort.

3. 3.

   What is stable sorting?

   • Maintaining the original order of elements
   • Randomizing elements
   • Sorting in descending order

   Hint

   Think about how it helps in sorting by multiple attributes.

4. 4.

   Is quick sort a stable sorting algorithm?

   • True
   • False

   Hint

   Remember how quick sort works.

5. 5.

   Given an array of records with names and scores, sort them using a stable sorting algorithm while preserving the original alphabetical order of names who scored the same.

   Hint

   Focus on how merge operation handles equal elements.

6. 6.

   Discuss a scenario in data processing where the cost of swapping would have a significant impact and suggest the best sorting algorithm to use.

   Hint

   Consider where your data is stored.