Java arraylist binarysearch
Posted on: October 23, 2009 at 12:00 AM
Posted on: October 23, 2009 at 12:00 AM
- It is a method for searching the array element in the given array.
- It is a static method of the class Arrays.
- It uses the binary search algorithm.
- It returns the index of the found element, but if element is not found then returns -1.
- Array can be of any data type object.
- Array used in binarySearch must be sorted.
- binarsearch() method with Unsorted arrays give wrong result.
- Array having duplicate elements when searched by binarySearch() function may return any of the duplicate element.
import java.util.Arrays;
public class binary_search {
public static void main(String[] args) {
int ar1[]={2,44,5,66,78,90,23,66};
int p, key=78;
p=Arrays.binarySearch(ar1, key);
System.out.println("element found at index "+p);
Arrays.sort(ar1);
p=Arrays.binarySearch(ar1, key);
System.out.println("element found at index "+p);
}
}
Output
element found at index 4
element found at index 6
If you are facing any programming issue, such as compilation errors or not able to find the code you are looking for.
Ask your questions, our development team will try to give answers to your questions.
Tutorial Topics
