Advertisement
Guest User

Untitled

a guest
Mar 28th, 2017
59
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.57 KB | None | 0 0
  1. public<T extends Comparable<T>> int binarySearch(ArrayList<T> names, T target, int start, int end){
  2. int mid = 0;
  3. boolean found = false;
  4.  
  5. while(start <= end && !found){
  6. mid = (start + end) / 2;
  7. if(names.get(mid).compareTo(target) == 0){
  8. found = true;
  9. }else if(names.get(mid).compareTo(target) > 0){
  10. end = mid - 1;
  11. }else{
  12. start = mid + 1;
  13. }//else
  14. }//while
  15.  
  16. if(found){
  17. return mid;
  18. }else{
  19. return -1;
  20. }//else
  21. }//binarySearch
  22.  
  23. public int compareTo(T o) {
  24. return this.name.compareTo((String) o);
  25. }//compareTo
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement