Save Write a program to implement Binary search using recursive algo.pdf
0 likes14 views
The document describes how to write a recursive binary search program in Java. It includes a sample code, prompts for user input, and explains how to find the index of a specified key in a given array. Additionally, it instructs the user to submit a screenshot of the source code and IDE results in a PDF file.
1 of 2
Download to read offline
![Save Write a program to implement Binary search using recursive algorithm. Submit a
screenshot of your Java source codes and IDE/Comment line results in PDF file.
Solution
BinarySearchTest.java
import java.util.Scanner;
public class BinarySearchTest {
public static void main(String[] args) {
int[] arr1 = { 1,2,3,4,5,6,7,8,9,10};
Scanner scan = new Scanner(System.in);
System.out.println("Enter the key: ");
int key = scan.nextInt();
int index = binarySearch(arr1,0,arr1.length,key);
System.out.println("Index is "+index);
}
public static int binarySearch(int[] array, int a, int e, int key) {
if (a < e) {
int mid = a + (e - a) / 2;
if (key < array[mid]) {
return binarySearch(array, a, mid, key);
} else if (key > array[mid]) {
return binarySearch(array, mid+1, e , key);
} else {
return mid;
}
}
return -1;
}
}
Output:
Enter the key:
4](https://image.slidesharecdn.com/savewriteaprogramtoimplementbinarysearchusingrecursivealgo-230702161904-4586554a/85/Save-Write-a-program-to-implement-Binary-search-using-recursive-algo-pdf-1-320.jpg)
More Related Content
Similar to Save Write a program to implement Binary search using recursive algo.pdf (20)
More from arihantmobileselepun (20)
Ad
Recently uploaded (20)
Ad
Save Write a program to implement Binary search using recursive algo.pdf
- 1. Save Write a program to implement Binary search using recursive algorithm. Submit a screenshot of your Java source codes and IDE/Comment line results in PDF file. Solution BinarySearchTest.java import java.util.Scanner; public class BinarySearchTest { public static void main(String[] args) { int[] arr1 = { 1,2,3,4,5,6,7,8,9,10}; Scanner scan = new Scanner(System.in); System.out.println("Enter the key: "); int key = scan.nextInt(); int index = binarySearch(arr1,0,arr1.length,key); System.out.println("Index is "+index); } public static int binarySearch(int[] array, int a, int e, int key) { if (a < e) { int mid = a + (e - a) / 2; if (key < array[mid]) { return binarySearch(array, a, mid, key); } else if (key > array[mid]) { return binarySearch(array, mid+1, e , key); } else { return mid; } } return -1; } } Output: Enter the key: 4
- 2. Index is 3