- Computer Science Engineering (CSE)
- Data Structures (DS)
- Searching, Sorting and Hashing Technique...
- What is the best case and worst case com...

Q. |
## What is the best case and worst case complexity of ordered linear search? |

A. | O(nlogn), O(logn) |

B. | O(logn), O(nlogn) |

C. | O(n), O(1) |

D. | O(1), O(n) |

Answer» D. O(1), O(n) |

View all MCQs in:
Data Structures (DS)

- What is the worst case complexity of binary search using recursion?
- What is the worst case for linear search?
- In linear search algorithm the Worst case occurs when ____________.
- The Worst case occur in linear search algorithm when_____________.
- What are the worst case and average case complexities of a binary search tree?
- What is the worst case time complexity of inserting a node in a doubly linked list?
- The worst case complexity of deleting any arbitrary node value element from heap is
- What is the worst case complexity of bubble sort?
- What is the worst case complexity of selection sort?
- What is the worst case time complexity of LSD radix sort?

Login to Continue

It will take less than 2 minutes

Report MCQ