Question discussion

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

3121Easy DSSSB TGT Computer Science 0 replies 2 views

0

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

AGreedy algorithm
BBacktracking
CDivide and conquer
DDivide and conquer, backtracking and greedy algorithm

Correct answer: C

Explanation

Merge sort divides the array into halves, sorts them and merges them: divide and conquer.

Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!