MCQOPTIONS
Bookmark
Saved Bookmarks
→
Discrete Mathematics
→
Inference in Discrete Mathematics
→
The complexity of merge sort algorithm is..
1.
The complexity of merge sort algorithm is
A.
O(n)
B.
O(log n)
C.
O(n<sup>2</sup>)
D.
O(n log n)
Answer» E.
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
THE_WORST_CASE_OCCUR_IN_QUICK_SORT_WHEN?$
The_worst_case_complexity_of_quick_sort_is$
The complexity of Fibonacci series i?
The worst case complexity for insertion sort is
<p>The Worst case occur in linear search algorithm when</p>
The complexity of merge sort algorithm is
<p>The complexity of linear search algorithm is</p>
Which of the following case does not exist in complexity theory?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply