adplus-dvertising
frame-decoration

Question

What is the worst case time complexity of linear search algorithm?

a.

Ο(1)

b.

Ο(n)

c.

Ο(log n)

d.

Ο(n2)

Answer: (b).Ο(n)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is the worst case time complexity of linear search algorithm?

Similar Questions

Discover Related MCQs

Q. An algorithm is

Q. In context with time-complexity, find the odd out −

Q. Interpolation search is an improved variant of binary search. It is necessary for this search algorithm to work that −

Q. If the array is already sorted, which of these algorithms will exhibit the best performance

Q. Which of these algorithmic approach tries to achieve localized optimum solution −

Q. Apriori analysis of an algorithm assumes that −

Q. What is the worst case run-time complexity of binary search algorithm?

Q. Apriory algorithm analysis does not include −

Q. Time complexity of Depth First Traversal of is

Q. Travelling salesman problem is an example of

Q. Project scheduling is an example of

Q. Which of the following is an example of dynamic programming approach?

Q. Which of the following uses memoization?

Q. Which of the following asymptotic notation is the worst among all?

Q. Minimum number of moves required to solve a Tower of Hanoi puzzle is

Q. Program with highest run-time complexity is

Q. The time complexity of quick sort is …………..

Q. Two main measures for the efficiency of an algorithm are

Q. The time factor when determining the efficiency of algorithm is measured by

Q. The space factor when determining the efficiency of algorithm is measured by