Which of the following algorithm design technique is used in merge sort?

2011

Which of the following algorithm design technique is used in merge sort?

Answer: D. Divide and Conquer — Merge sort utilizes the Divide and Conquer technique. It works by recursively dividing the array into two halves until each subarray contains a single…

  1. A.

    Greedy method

  2. B.

    Backtracking

  3. C.

    Dynamic programming

  4. D.

    Divide and Conquer

Attempted by 1447 students.

Show answer & explanation

Correct answer: D

Merge sort utilizes the Divide and Conquer technique. It works by recursively dividing the array into two halves until each subarray contains a single element, then merging these sorted subarrays back together to produce the final sorted array.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…