- Computer Science Engineering (CSE)
- Data Structures (DS)
- In linear search algorithm the Worst cas...

Q. |
## In linear search algorithm the Worst case occurs when ____________. |

A. | The item is somewhere in the middle of the array. |

B. | The item is not in the array at all. |

C. | The item is the last element in the array. |

D. | The item is the last element in the array or is not there at all. |

Answer» D. The item is the last element in the array or is not there at all. |

View all MCQs in:
Data Structures (DS)

- The Worst case occur in linear search algorithm when_____________.
- What is the best case and worst case complexity of ordered linear search?
- What is the worst case for linear search?
- What are the worst case and average case complexities of a binary search tree?
- The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
- What is the worst case complexity of binary search using recursion?
- The complexity of linear search algorithm is____________.
- What is the best case for linear search?
- 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

Login to Continue

It will take less than 2 minutes

Report MCQ