+1 vote
in Data Structures & Algorithms II by (110k points)
Which of the following method is used for sorting in merge sort?

(a) merging

(b) partitioning

(c) selection

(d) exchanging

This question was posed to me during an interview for a job.

I want to ask this question from Sorting in portion Sorting of Data Structures & Algorithms II

1 Answer

+1 vote
by (614k points)
selected by
Best answer
Right option is (a) merging

For explanation: Merge sort algorithm divides the array into two halves and applies merge sort algorithm to each half individually after which the two sorted halves are merged together. Thus its method of sorting is called merging.

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.