Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I tried to google on this topic, but could not find anything satisfactory.
Question is: Can we apply the binary search for the un-sorted array to that the search can be done in O(logN) or so.
Could please someone point me to the right solution for this problem.
PS: I am 80% sure that this post might be duplicate
You can’t binary search on an unsorted array. Simple as that. The monotonic increasing or decreasing function is essential to the binary search, so you can decide in which half to continue searching.