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

(a) backtracking

(b) greedy algorithm

(c) divide and conquer

(d) dynamic programming

This question was addressed to me in an online quiz.

My doubt stems from Sorting in division Sorting of Data Structures & Algorithms II

1 Answer

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

For explanation: Merge sort uses divide and conquer in order to sort a given array. This is because it divides the array into two halves and applies merge sort algorithm to each half individually after which the two sorted 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.