Vidyalelo
Data Structure · Q211

Sorting Algorithms

Programming · Data Structure · question 211

Q211

Choose the correct statement about bottom up merge sort from the following?

A.
bottom up merge sort has greater time complexity than standard merge sort
B.
bottom up merge sort has lesser time complexity than standard merge sort
C.
bottom up merge sort saves auxiliary space required on call stack
Answer
D.
bottom up merge sort uses recursion.

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board