MCQOPTIONS
Bookmark
Saved Bookmarks
→
Java
→
Builtin Exceptions in Java
→
The worst case complexity of quick sort is _______..
1.
The worst case complexity of quick sort is _________
A.
O(n)
B.
O(log n)
C.
O(n²)
D.
O(n log n)
Answer» D. O(n log n)
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
For a recursive algorithm _________
If for an algorithm time complexity is given by O(n²) then complexity will ___________
Which is used to measure the Time complexity of an algorithm Big O notation?
The worst case complexity for insertion sort is _________
An algorithm which uses the past results and uses them to find the new results is _________
Which algorithm is better for sorting between bubble sort and quicksort?
If for an algorithm time complexity is given by O((3⁄2)ⁿ) then complexity will be ___________
The decimal notation of 101010101 is ___________
The binary notation of ABBA is ___________
The value of 12 mod 3 is?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply