- Computer Science Engineering (CSE)
- Data Structures (DS)
- The complexity of linear search algorith...

Q. |
## The complexity of linear search algorithm is____________. |

A. | O(log n). |

B. | O(n). |

C. | O(n2). |

D. | O(n log n). |

Answer» B. O(n). |

View all MCQs in:
Data Structures (DS)

- What is the best case and worst case complexity of ordered linear search?
- The complexity of Binary search algorithm is ____________.
- In linear search algorithm the Worst case occurs when ____________.
- The Worst case occur in linear search algorithm when_____________.
- What is the worst case complexity of binary search using recursion?
- What is the average case time complexity of binary search using recursion?
- What is the time complexity of binary search with iteration?
- What is the space complexity of a linear queue having n elements?
- What is the time complexity of an infix to postfix conversion algorithm?
- The complexity of Bubble sort algorithm is _________.

Login to Continue

It will take less than 2 minutes

Report MCQ