17.1.7. Naive vs. Complex Sorting Algorithms

Try these first

1. 1.

   Define stable sorting.

   Hint

   Think about how alphabetical order should remain when sorting by marks.

2. 2.

   What is quicksort? Why might it not be stable?

   Hint

   Consider how elements are rearranged.

3. 3.

   Which of the following sorting algorithms is stable?

   • Quicksort
   • Merge Sort
   • Selection Sort

   Hint

   Recall the characteristic of stability.

4. 4.

   True or False: Insertion sort is a stable algorithm.

   • True
   • False

   Hint

   Think about how insertion sort works.

5. 5.

   Design a sorting algorithm that is stable and efficient for large datasets. What considerations will you make?

   Hint

   Focus on both algorithm complexity and real-world constraints.

6. 6.

   Analyze a scenario in a real-world application (like sorting names and scores in a classroom) and determine which sorting algorithm would be the best choice. Justify your choice based on the dataset size and stability requirements.

   Hint

   Reflect on both the size of data and the importance of maintaining order.