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

Q. |
## What is the worst case complexity of binary search using recursion? |

A. | O(nlogn) |

B. | O(logn) |

C. | O(n) |

D. | O(n2) |

Answer» B. O(logn) |

View all MCQs in:
Data Structures (DS)

- What is the average case time complexity of binary search using recursion?
- The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
- What is the best case and worst case complexity of ordered linear search?
- 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?
- What is the time complexity of binary search with iteration?

Login to Continue

It will take less than 2 minutes

Report MCQ