- Computer Science Engineering (CSE)
- Data Structures (DS)
- Searching, Sorting and Hashing Technique...
- What is the best case for linear search?

Q. |
## What is the best case for linear search? |

A. | O(nlogn) |

B. | O(logn) |

C. | O(n) |

D. | O(1) |

Answer» D. O(1) |

View all MCQs in:
Data Structures (DS)

- What is the best case and worst case complexity of ordered linear search?
- 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_____________.
- The time required in best case for search operation in binary tree is ____________.
- What are the worst case and average case complexities of a binary search tree?
- Which of the following is a disadvantage of linear search?
- The complexity of linear search algorithm is____________.
- A linear collection of data elements where the linear node is given by means of pointer is called?
- The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.

Login to Continue

It will take less than 2 minutes

Report MCQ