GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Algorithm/java/coding/binarySearch.java at master · lelea2/Algorithm Expand file tree/ Copy pathbinarySearch.javaMore file actions 23 lines (21 loc) · 727 Bytes / Copy pathbinarySearch.javaFile metadata and controls23 lines (21 loc) · 727 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 /** * Simple binary search in Java for array of integer */ //Purposes: test your basic skill of recursion //Function will take the array, start and end index and the number we want to look for //return the index that has the requested value //Runtime: O(logn) public static int binarySearch(int arr[], int low, int high, int num) { if (high < low) { //return -1 for invalid cases return -1; } int mid = (low + high) / 2; //calculate the middle index if (num == arr[mid]) { return mid; } if (num > arr[mid]) { //walk the right tree return binarySearch(arr, (mid + 1), high, num); } else {//walk the left tree return binarySearch(arr, low, (mid - 1), num); } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |