17.1. Sorting: Concluding Remarks

Try these first

1. 1.

   Define stable sorting.

   Hint

   Think about how sorting ties are handled.

2. 2.

   Why is quicksort generally considered fast?

   Hint

   Consider how many elements it divides at each step.

3. 3.

   What is the main benefit of stable sorting?

   • It is faster than all algorithms
   • It preserves the order of equal elements
   • It requires less memory

   Hint

   Focus on what happens to tied elements during sorting.

4. 4.

   True or False: All sorting algorithms are stable.

   • True
   • False

   Hint

   Recall examples of unstable sorting methods.

5. 5.

   Consider a dataset of 500,000 records that needs to be sorted primarily by date and secondarily by name. Which sorting algorithm would you choose and why?

   Hint

   Think about both the size and nature of the data.

6. 6.

   You have two algorithms: Algorithm A (O(n^2)) and Algorithm B (O(n log n)). If you need to sort 1000 records which would you choose? Explain your reasoning.

   Hint

   Consider time complexity benefits as data size increases.