MCQOPTIONS
Bookmark
Saved Bookmarks
→
Data Structure
→
Number Jumps Reach End Array Operation in Data Structure
→
What is the average case complexity of QuickSort?..
1.
What is the average case complexity of QuickSort?
A.
O(nlogn)
B.
O(logn)
C.
O(n)
D.
O(n<sup>2</sup>)
Answer» B. O(logn)
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following is not true about QuickSort?
The given array is arr = {2,6,1}. What are the pivots that are returned as a result of subsequent partitioning?
What is the average case complexity of QuickSort?
QuickSort can be categorized into which of the following?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply