MCQOPTIONS
Bookmark
Saved Bookmarks
→
Database
→
Managing Databases With Oracle in Database
→
The complexity of a linear search algorithm i?..
1.
The complexity of a linear search algorithm i?
A.
O(n)
B.
O(log n)
C.
O(n2)
D.
O(n log n)
Answer» B. O(log n)
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
THE_COMPLEXITY_OF_BINARY_SEARCH_ALGORITHM_IS?$
The_complexity_of_Bubble_sort_algorithm_is$
The complexity of a linear search algorithm i?
The complexity of the average case of an algorithm is
The Average case occur in linear search algorithm
The Worst case occur in linear search algorithm when
Which of the following case does not exist in complexity theory
The time factor when determining the efficiency of an algorithm is measured by
Two main measures for the efficiency of an algorithm are
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply