+1 vote
in Data Structures & Algorithms II by (110k points)
Merge sort uses which of the following algorithm to implement sorting?

(a) backtracking

(b) greedy algorithm

(c) divide and conquer

(d) dynamic programming

I have been asked this question in homework.

This question is from Sorting in section Sorting of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
Best answer
Correct option is (c) divide and conquer

Easy explanation - Merge sort uses the technique of divide and conquer in order to sort a given array. It divides the array into two halves and applies merge sort algorithm to each half individually after which the sorted versions of these halves are merged together.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.