UTpaper

Free mock tests & test series

Question 99Asked in BPSC TRE 3.0 (2024) Computer Science Class 11-12

Merge Sort is an example of which algorithm design paradigm?

  1. AGreedy
  2. BDivide and Conquer
  3. CDynamic Programming
  4. DMore than one of the above
  5. ENone of the above
Show answerHide answer

Correct answer: (B) Divide and Conquer

Explanation

Merge sort splits the array into halves, sorts each half recursively and merges them, which is the divide-and-conquer paradigm.

From BPSC TRE 3.0 (2024) Computer Science Class 11-12 — Previous Year Paper

This is question 99 of BPSC TRE 3.0 (2024) Computer Science Class 11-12 — Previous Year Paper. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.