MCQOPTIONS
Bookmark
Saved Bookmarks
→
Computer Science Engineering (CSE)
→
Software Design Modeling
→
The time complexity of quicksort is ..
1.
The time complexity of quicksort is ..
A.
O(n)
B.
O(logn)
C.
O(n2)
D.
O(n logn)
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
A graph in which all vertices have equal degree is known as ____
A graph is a tree if and only if graph is
Minimum number of fields in each node of a doubly linked list is____
A vertex of in-degree zero in a directed graph is called a/an
The elements of a linked list are stored
Which of the following data structure can t store the non-homogeneous data elements?
To perform level-order traversal on a binary tree, which of the following data structure will be required?
A parentheses checker program would be best implemented using
Which of the following data structure is required to convert arithmetic expression in infix to its equivalent postfix notation?
Quick sort is also known as ..
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
