Which algorithm is designed to find the median in linear time by recursively partitioning the data into smaller groups?

Which algorithm is designed to find the median in linear time by recursively partitioning the data into smaller groups?

• A. Median of Medians
• B. Quick Sort
• C. Heap Sort
• D. Binary Search

Answer: (A)

Finding a median in linear time uses a robust way to choose the pivot during partitioning. The median of medians method splits the data into small groups (five elements each), sorts each group to get its median, and then recursively finds the median of these medians to serve as the pivot. Partitioning the data around this pivot guarantees that a fixed fraction of elements is discarded in each step, so the sizes of the subproblems shrink quickly enough that the total time stays proportional to the input size. This yields a worst-case linear-time algorithm for selecting the median, unlike other methods that rely on sorting or binary search. Quick Sort and Heap Sort, while efficient for sorting, run in about O(n log n) time and are not designed to guarantee linear time for finding just the median. Binary Search requires a pre-sorted array and is used to locate a specific value, not to find the median of an unsorted set.

Finding a median in linear time uses a robust way to choose the pivot during partitioning. The median of medians method splits the data into small groups (five elements each), sorts each group to get its median, and then recursively finds the median of these medians to serve as the pivot. Partitioning the data around this pivot guarantees that a fixed fraction of elements is discarded in each step, so the sizes of the subproblems shrink quickly enough that the total time stays proportional to the input size. This yields a worst-case linear-time algorithm for selecting the median, unlike other methods that rely on sorting or binary search.

Quick Sort and Heap Sort, while efficient for sorting, run in about O(n log n) time and are not designed to guarantee linear time for finding just the median. Binary Search requires a pre-sorted array and is used to locate a specific value, not to find the median of an unsorted set.