Q. What is the best case and worst case complexity of ordered linear search? (Solved)

1. O(nlogn), O(logn)

2. O(logn), O(nlogn)

3. O(n), O(1)

4. O(1), O(n)

  • d. O(1), O(n)

Related Topics

Subscribe Now

Get All Updates & News