15.1.1. Purpose of Quick Sort

Try these first

1. 1.

   What is the main purpose of Quick Sort?

   Hint

   Think about how it improves upon Merge Sort.

2. 2.

   What does the pivot do in Quick Sort?

   Hint

   It separates smaller and larger elements.

3. 3.

   Which algorithm does Quick Sort aim to improve upon?

   • Bubble Sort
   • Merge Sort
   • Selection Sort

   Hint

   Think of the extra space used in the other algorithm.

4. 4.

   True or False: Quick Sort requires extra storage for merging elements.

   • True
   • False

   Hint

   Consider how data is organized in Quick Sort.

5. 5.

   Critique the efficiency of Quick Sort in relation to different pivot selection strategies. How might a consistently poor selection impact performance?

   Hint

   Evaluate how the choice of a pivot can impact the division of the array.

6. 6.

   Implement Quick Sort in Python. Provide a sample array and walk through the partitioning elements.

   Hint

   Follow the steps we discussed for partitioning to code.