2
Informatik (Fach) / Suchen (Lektion)
- binarySearch int[] data;2 int size;34 public boolean binarySearch(int key) 5 {6 int low = 0;7 int high = size - 1;8 9 while(high >= low) {10 int middle = (low + high) / 2;11 if(data[middle] == key) {12 return true;13 }14 if(data[middle] < key) {15 low = middle + 1;16 }17 if(data[middle] > key) {18 high = middle - 1;19 }20 }21 return false;22 }
- linear search public int linearSearch(int search, int[] array){ for (c = 0; c < n; c++){ if (array[c] == search) /* Searching element is present */{ return c; // returns index of array, which contains searched integer } }}