Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class BusquedaBinaria {
- // Returns index of x if it is present in arr[l..
- // r], else return -1
- int binarySearch(int arr[], int l, int r, int x)
- {
- if (r >= l) {
- int mid = l + (r - l) / 2;
- // If the element is present at the
- // middle itself
- if (arr[mid] == x)
- return mid;
- // If element is smaller than mid, then
- // it can only be present in left subarray
- if (arr[mid] > x)
- return binarySearch(arr, l, mid - 1, x);
- // Else the element can only be present
- // in right subarray
- return binarySearch(arr, mid + 1, r, x);
- }
- // We reach here when element is not present
- // in array
- return -1;
- }
- // Metodo Main
- public static void main(String args[])
- {
- BusquedaBinaria ob = new BusquedaBinaria();
- int arr[] = { 2, 3, 4, 10, 40, 75, 103 };
- int n = arr.length;
- int x = 10;
- int result = ob.binarySearch(arr, 0, n - 1, x);
- if (result == -1)
- System.out.println("[-1] No se encuentra el elemento");
- else
- System.out.println("Elemento encontrado en el índice: " + result);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement