AMA University Answers
Login
Register
AMA OED
Courses
ITE
ITE-6201
order is the best possible fo...
_____________ order is the best possible for array sorting algorithm which sorts n item.
O(n+logn)
Correct
O(n logn)
O(n2)
O(logn)
Similar ITE-6201 questions
Unsorted lists are elements arranged according to some criteria.
It doesn't require a binary tree to be traverse when using insertion or deletion.
The elements are removal from a stack in order.
The rearranging of pairs of elements which are out of order, until no such pairs remain.
Another name for directed graph.
If a linked list is unordered, we can insert a new item at either the end or the beginning.