McqMate
Login
Register
Home
Search
Login
Register
Computer Science Engineering (CSE)
Data Structure (DS)
The time complexity of quicksort is …….....
Q.
The time complexity of quicksort is ……..
A.
O(n)
B.
O(logn)
C.
O(n2)
D.
O(n logn)
Answer» D. O(n logn)
View all MCQs in:
Data Structure (DS)
Discussion
Comment
Related Questions
The time complexity of quick sort is …………..
Worst space complexity of queue data structure is
Worst space complexity of stack data structure is
Worst space complexity of singly linked list is
The total number of elements in a stack at a given point of time can be calculated from the value of______.
Login to Continue
It will take less than 2 minutes
Continue with Google
Continue with Linkedin
Continue with Twitter
Report MCQ
Remark*
Report