Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public static <E extends Comparable<E>> int binarySearch(E[] list, E key) {
- if (list.length >= 1) {
- int mid = list.length / 2;
- E[] half = null;
- if (key.compareTo(list[mid]) == 0) {
- return mid;
- }
- if (key.compareTo(list[mid]) > 0) {
- half = Arrays.copyOfRange(list, mid + 1, list.length);
- } else if (key.compareTo(list[mid]) < 0) {
- half = Arrays.copyOfRange(list, 0, mid);
- }
- return binarySearch(half, key);
- }
- return -1;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement