MCQOPTIONS
Bookmark
Saved Bookmarks
→
Library Sort Multiple Choice
→
General
→
What is the auxiliary space complexity of library...
1.
What is the auxiliary space complexity of library sort?
A.
O(n)
B.
O(1)
C.
O(n log n)
D.
O(n<sup>2</sup>)
Answer» B. O(1)
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following is not true about library sort?
What is the auxiliary space complexity of library sort?
What is the advantage of library sort over insertion sort?
Which of the following is an alternate name of library sort?
What is the worst case time complexity of library sort?
What is the best case time complexity of library sort?
What is the average case time complexity of library sort?
Library sort is a comparison based sort.
Which of the following sorting algorithm requires the use of binary search in their implementation?
Library sort is a modified version of which of the following sorting algorithm?
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