Binary Search Algorithm: Iterative Implementation.

 

Iterative Implementation of Binary Search Algorithm. 

Binary Search Algorithm is used to search an element in an Array.

Binary search algorithm is always applied to an Sorted array.

import java.util.*;
public class Iterative_binarysearch {
    int binarysearch(int arr[],int x)
    {
        int l=0;
        int r= arr.length-1;
        while(r>=l)
        {
            int mid=(l+r)/2;
            if(x==arr[mid])
                return mid;
            if(x>arr[mid])
                l=mid+1;
            if(x<arr[mid])
                r=mid-1;
        }
        return -1;
    }
    public static void main(String[] args) {
        Iterative_binarysearch ob = new Iterative_binarysearch();
        int arr[]={2,3,4,10,40};
        int n = arr.length;
        int x=10;
        int result=ob.binarysearch(arr,x);
        if(result==-1)
        {
          System.out.println("Element is not present in array.");
        }
        else        {
         System.out.println("Element is present in array at index: "+result);
        }
    }
}

Output: