AMA University Answers
Login
Register
AMA OED
Courses
ITE
ITE-6201
The complexity of linear searc...
The complexity of linear search algorithm.
O(logn)
O(n logn)
O(n)
Correct
O(n2)
Similar ITE-6201 questions
the upward movement of the newly inserted entry by means of swaps is conventionally called
The terms depth-first and breadth-first are two most common graph algorithm
The operation commonly performed in graphs that store the graph in computer memory using a particula...
This indicates the end of the list.
There are two types of linked lists; sorted lists and unsorted lists.
The top element of a tree is called the