MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Transpose of a Matrix

Merge sort us...

Question

Merge sort uses

A

Divide and conquer strategy

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

B

Backtracking approach

No worries! We‘ve got your back. Try BYJU‘S free classes today!

C

Heuristic search

No worries! We‘ve got your back. Try BYJU‘S free classes today!

D

Greedy approach

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is A Divide and conquer strategy
A merge sort is comparison based sorting algorithm and divide-and-conquer algorithm.

Suggest Corrections

thumbs-up

0

Similar questions

Q. Which of the following represents the number of elements that can be sorted in

Θ (n)

times using merge sort?

Q. Consider the following statement:

I. If 'K' is no. of merge operations involved in merge sort technique then K = O(n)
II. Both Quick sort and merge sort are In-place sorting
III. If the elements are already sorted, then the time complexity of Quick sort is better than merge sort.

Which of the above statements are correct?

Q. Which of the following sorting algorithms are stable?

I. Insertion sort II. Bubble sort
III. Merge sort IV. Heap sort

Q. A list of n strings, each of length n, is sorted into lexicographic order using the merge sort algorithm. The worst case running time of this computation is

Q. For merging two sorted lists of sizes m and n into a sorted list of size m+n, we required comparisons of

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Transpose of a Matrix

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Transpose of a Matrix

Standard XII Mathematics

Join BYJU'S Learning Program

CrossIcon