# Answers for "binary search recursive algorithm"

0

recursive binary search

``````import java.util.Scanner;

public class BinarySearching {
public static void main(String[] argh){
System.out.println("Enter the size of the Array: ");
Scanner input = new Scanner(System.in);
int size = input.nextInt();
int [] array = new int[size];

int[] binarySort = enterValues(array,size);

System.out.println("Which number you want to find? ");
int numberTofind = input.nextInt();

int low =0;
int high = binarySort.length-1;

if(findNumber(binarySort,numberTofind,low,high) == -1){
System.out.println("The number you entered dose not exist");
return;
}

System.out.println("the number is at index: "+findNumber(binarySort,numberTofind,low,high));

}
public static int[] enterValues(int [] arr,int size){
System.out.println("Enter Sorted Array: ");
for(int i=0 ; i<size;++i){
arr[i] = i;
}
return arr;
}

public static int findNumber(int [] sortedArray, int findThisNumber,int low , int high ){
int midle = (low+high)/2;
if(sortedArray[midle]==findThisNumber)
{ return midle;
}else if(sortedArray[midle] < findThisNumber)
{
return findNumber(sortedArray,findThisNumber,low=midle+1,high);
}else if(sortedArray[midle] > findThisNumber)
{
return findNumber(sortedArray,findThisNumber,low,high=midle-1);
}
return -1;
}

}``````
Posted by: Guest on July-17-2021
1

binary search iterative

``````// Binary Search using Iterative Approach

import java.io.*;
class Binary_Search
{
public static void main(String[] args) throws Exception
{
Binary_Search obj = new Binary_Search();
System.out.println("Insert the length of the Array : ");
int n = Integer.parseInt(br.readLine());
int arr[] = new int[n];
System.out.println("Insert elements into the array : ");
for(int i=0;i<n;i++)
{
}
System.out.println("Enter the num which you want to Search : ");
int num = Integer.parseInt(br.readLine());
obj.logic(arr,num);
}
void logic(int arr[],int num)
{
int r = arr.length - 1;
int l = 0;
int mid;
while(l<=r)
{
mid = l + (r-l)/2;
if(arr[mid] == num)
{
System.out.println("Number found at "+mid+"th index");
break;
}
else if(arr[mid]>num)
{
r = mid - 1;
}
else
{
l = mid + 1;
}
}
}
}``````
Posted by: Guest on June-23-2020