MCQOPTIONS
Bookmark
Saved Bookmarks
→
Bottom-Up Mergesort Multiple Choice
→
General
→
What is the auxiliary space complexity of standard...
1.
What is the auxiliary space complexity of standard merge sort?
A.
O(1)
B.
O(log n)
C.
O(n)
D.
O(n log n)
Answer» D. O(n log n)
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Choose the correct statement about bottom up merge sort from the following?
Bottom up merge sort is a stable sort.
Bottom up merge sort uses recursion.
Merge sort uses which of the following method to implement sorting?
What is the average time complexity of bottom up merge sort?
What is the auxiliary space complexity of bottom up merge sort?
What is the auxiliary space complexity of standard merge sort?
What is the average case time complexity of standard merge sort?
Merge sort uses which of the following algorithm to implement sorting?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies