Question 156Asked in DSSSB TGT Computer Science, 25 Jun 2023, Shift 2 (12:30 PM)

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

  1. AGreedy algorithm
  2. BBacktracking
  3. CDivide and conquer
  4. DDivide and conquer, backtracking and greedy algorithm
Show answerHide answer

Correct answer: (C) Divide and conquer

Explanation

Merge sort uses divide and conquer: it splits the array into halves, sorts each half recursively and then merges the two sorted halves.

From DSSSB TGT Computer Science PYQ, 25 Jun 2023, Shift 2 (12:30 PM)

This is question 156 of DSSSB TGT Computer Science PYQ, 25 Jun 2023, Shift 2 (12:30 PM). 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.