15.1.2. Finding the Median

Try these first

1. 1.

   What is the goal of Quick Sort?

   Hint

   Think about how you would compare numbers.

2. 2.

   Define the median.

   Hint

   Consider the order of numbers.

3. 3.

   What does Quick Sort primarily utilize for sorting?

   • Merging
   • Partitioning
   • Heap
   • Stack

   Hint

   Think about how elements are organized in Quick Sort.

4. 4.

   True or False: The median is always an element of the array.

   • True
   • False

   Hint

   Consider how the median is defined.

5. 5.

   Describe how Quick Sort can be optimized for worst-case scenarios, particularly in a nearly sorted array.

   Hint

   Consider the nature of the input data and how it influences sorting.

6. 6.

   Write a recursive function in pseudocode that implements Quick Sort and explain each step.

   Hint

   Step through the sorting process logically, noting how elements are dealt with.