17.1.8. Hybrid Algorithms

Try these first

1. 1.

   Define stable sorting in your own words.

   Hint

   Think about how order is maintained during sorting.

2. 2.

   Name one sorting algorithm that is stable.

   Hint

   Recall the characteristics we discussed about merge sort.

3. 3.

   What is stable sorting?

   Hint

   Think about sorting names or IDs that might repeat.

4. 4.

   Quick sort is a stable sorting algorithm. (True/False)

   Hint

   Recall how quick sort handles equal elements.

5. 5.

   Design a hybrid sorting algorithm that combines quick sort and insertion sort. Explain when each part of the algorithm would be used based on data size.

   Hint

   Think about the characteristics of quick sort and insertion sort, especially their performance with different data sizes.

6. 6.

   Imagine you are sorting a large list of students based on grades while maintaining their alphabetical order in case of grade ties. Which sorting algorithm would you choose and why?

   Hint

   Consider the importance of stability in this scenario and which algorithms support it.