public class BinarySearch {
/** Use binary search to find the key in the list */
public static int binarySearch(int[] list, int key) {
int low = 0;
int high = list.length - 1;
while (high >= low) {
You've reached the end of your free preview.
Want to read the whole page?
- Spring '09
- BAJIC
- Binary Search, Justice League Unlimited, int binarySearch, public class BinarySearch, int HIGH
