Binary search performs search in O(log n). But, it can be used only if the array is sorted.
Which is the best searching technique if the array is unsorted?
Share
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.
Binary search performs search in O(log n). But, it can be used only if the array is sorted.
Which is the best searching technique if the array is unsorted?
If you’re only doing a few searches, then a basic linear search is about the best you can do.
If you’re going to search very often, it’s usually better to sort, then use a binary search (or, if the distribution of the contents if fairly predictable, an interpolation search).