AMA University Answers
Login
Register
AMA OED
Courses
ITE
ITE-6201
The complexity of bubble sort...
The complexity of bubble sort algorithm.
O(n)
O(n2)
Correct
O(logn)
O(n logn)
Similar ITE-6201 questions
This is a terminal node in a binary tree.
The depth of complete binary tree is given by .
This is a binary tree whose every node has either zero or two children.
The root of a tree is the node that has no ancestors.
"This form of access is used to add/remove nodes from a stack. "
The operation of processing each element in the list is known as .