/Users/johnr/Dropbox/johnrayworth.info/largeFilesOutsideJSR/__IB-Other/Other/IA-Solutions-2019/Proud/Product/ComputerScienceInternalAssessmentV2/src/computerscienceinternalassessment/BinarySearch.java |
1
2
3
4
5
6 package computerscienceinternalassessment;
7
8 import java.util.ArrayList;
9
10
11
12 @author
13
14 public class BinarySearch {
15
16 public int binarySearch(ArrayList<Palette> arr, String key){
17 int low =0;
18 int high = arr.size()-1;
19 while(low <= high){
20 int mid = (low + high) / 2;
21 if(arr.get(mid).getPaletteName().equals(key))
22 return mid;
23 else if(arr.get(mid).getPaletteName().compareTo(key) < 1)
24 low = mid + 1;
25 else
26 high = mid -1;
27 }
28 return -1;
29 }
30
31 }
32