UTpaper

Free mock tests & test series

Question 117Asked in BPSC TRE 2.0 (2023) Computer Class 9-10

Which of the following is a divide-and-conquer algorithm?

  1. AMerge sort
  2. BHeap sort
  3. CBubble sort
  4. DMore than one of the above
  5. ENone of the above
Show answerHide answer

Correct answer: (A) Merge sort

Explanation

Merge sort splits the list in halves, sorts them and merges, which is divide and conquer.

From BPSC TRE 2.0 (2023) Computer Class 9-10 — Previous Year Paper

This is question 117 of BPSC TRE 2.0 (2023) Computer Class 9-10 — 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.