AMA University Answers
Login
Register
AMA OED
Courses
ITE
ITE-6201
The complexity of merge sort a...
The complexity of merge sort algorithm.
O(logn)
O(n)
O(n logn)
Correct
O(n2)
Similar ITE-6201 questions
the association of keys and values defines a .
The average case occurs in linear search algorithm .
The upward movement of the newly inserted entry by means of swapping
The worst case occurs in linear search algorithm when .
The following are some of the applications of heaps except
The complexity of linear search algorithm.