McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2024
→
Computer Science Engineering (CSE)
→
Data Structures (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)
2.6k
0
Do you find this helpful?
14
View all MCQs in
Data Structures (DS)
Discussion
No comments yet
Login to comment
Related MCQs
The time complexity of quick sort is …………..
What is the time complexity of inserting at the end in dynamic arrays?
What is the time complexity to count the number of elements in the linked list?
What is the worst case time complexity of inserting a node in a doubly linked list?
What is the time complexity of searching for an element in a circular linked list?
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?
What would be the asymptotic time complexity to find an element in the linked list?
What would be the asymptotic time complexity to insert an element at the second position in the linked list?
What is the time complexity of an infix to postfix conversion algorithm?
