Advertisement
Guest User

Untitled

a guest
Nov 21st, 2019
147
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.48 KB | None | 0 0
  1. public static <E extends Comparable<E>> int binarySearch(E[] list, E key) {
  2. if (list.length >= 1) {
  3. int mid = list.length / 2;
  4. E[] half = null;
  5. if (key.compareTo(list[mid]) == 0) {
  6. return mid;
  7. }
  8.  
  9. if (key.compareTo(list[mid]) > 0) {
  10. half = Arrays.copyOfRange(list, mid + 1, list.length);
  11. } else if (key.compareTo(list[mid]) < 0) {
  12. half = Arrays.copyOfRange(list, 0, mid);
  13. }
  14.  
  15. return binarySearch(half, key);
  16. }
  17.  
  18. return -1;
  19. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement