- Tutorials
- Courses
Data Structure
Java
Python
HTML
Interview Preparation
Algorithms | Divide and Conquer | Question 6
Last Updated :
Discuss
Comments
Consider the problem of searching an element x in an array 'arr[]' of size n. The problem can be solved in O(Logn) time if.
1) Array is sorted
2) Array is sorted and rotated by k. k is given to you and k <= n
3) Array is sorted and rotated by k. k is NOT given to you and k <= n
4) Array is not sorted
1 Only
1 & 2 only
1, 2 and 3 only
1, 2, 3 and 4
This question is part of this quiz :
Top MCQs on Divide and Conquer Algorithm with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy