MCQOPTIONS
Bookmark
Saved Bookmarks
→
Merge Sort Multiple Choice
→
General
→
Merge sort can be implemented using O(1) auxiliary...
1.
Merge sort can be implemented using O(1) auxiliary space.
A.
true
B.
false
Answer» B. false
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following sorting algorithm does not use recursion?
Which of the following sorting algorithm makes use of merge sort?
Merge sort is preferred for arrays over linked lists.
Which of the following stable sorting algorithm takes the least time when applied to an almost sorted array?
Which of the following is not a stable sorting algorithm?
Which of the following is not in place sorting algorithm by default?
Which of the following is not a variant of merge sort?
What will be the best case time complexity of merge sort?
Which of the following method is used for sorting in merge sort?
What is the worst case time complexity of merge sort?
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
